/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-OGIterative.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-atomic/qrcu-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-12 23:34:31,711 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-12 23:34:31,713 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-12 23:34:31,732 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-12 23:34:31,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-12 23:34:31,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-12 23:34:31,734 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-12 23:34:31,736 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-12 23:34:31,737 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-12 23:34:31,738 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-12 23:34:31,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-12 23:34:31,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-12 23:34:31,739 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-12 23:34:31,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-12 23:34:31,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-12 23:34:31,741 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-12 23:34:31,742 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-12 23:34:31,742 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-12 23:34:31,744 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-12 23:34:31,745 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-12 23:34:31,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-12 23:34:31,747 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-12 23:34:31,747 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-12 23:34:31,748 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-12 23:34:31,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-12 23:34:31,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-12 23:34:31,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-12 23:34:31,750 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-12 23:34:31,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-12 23:34:31,751 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-12 23:34:31,752 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-12 23:34:31,752 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-12 23:34:31,753 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-12 23:34:31,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-12 23:34:31,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-12 23:34:31,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-12 23:34:31,755 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-12 23:34:31,755 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-12 23:34:31,755 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-12 23:34:31,755 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-12 23:34:31,756 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-12 23:34:31,757 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-OGIterative.epf [2021-08-12 23:34:31,778 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-12 23:34:31,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-12 23:34:31,779 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-12 23:34:31,779 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-12 23:34:31,779 INFO L138 SettingsManager]: * Use SBE=true [2021-08-12 23:34:31,779 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-12 23:34:31,780 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-12 23:34:31,780 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-12 23:34:31,780 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-12 23:34:31,780 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-12 23:34:31,780 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-12 23:34:31,780 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-12 23:34:31,781 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-12 23:34:31,781 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-12 23:34:31,781 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-12 23:34:31,781 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-12 23:34:31,781 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-12 23:34:31,781 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-12 23:34:31,781 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-12 23:34:31,781 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-12 23:34:31,782 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-12 23:34:31,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-12 23:34:31,782 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-12 23:34:31,782 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-12 23:34:31,782 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-12 23:34:31,782 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-12 23:34:31,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-12 23:34:31,782 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-12 23:34:31,783 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-12 23:34:31,783 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-12 23:34:31,783 INFO L138 SettingsManager]: * Compute cosets for OwickiGries annotation iteratively=true [2021-08-12 23:34:31,783 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 [2021-08-12 23:34:31,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-12 23:34:32,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-12 23:34:32,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-12 23:34:32,029 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-12 23:34:32,031 INFO L275 PluginConnector]: CDTParser initialized [2021-08-12 23:34:32,032 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/qrcu-1.i [2021-08-12 23:34:32,103 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ca8d6fb/76b3ce7394324975b2b1b42539254bd5/FLAG2204112cb [2021-08-12 23:34:32,654 INFO L306 CDTParser]: Found 1 translation units. [2021-08-12 23:34:32,655 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i [2021-08-12 23:34:32,665 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ca8d6fb/76b3ce7394324975b2b1b42539254bd5/FLAG2204112cb [2021-08-12 23:34:32,983 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ca8d6fb/76b3ce7394324975b2b1b42539254bd5 [2021-08-12 23:34:32,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-12 23:34:32,989 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-12 23:34:32,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-12 23:34:32,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-12 23:34:32,993 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-12 23:34:32,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 11:34:32" (1/1) ... [2021-08-12 23:34:32,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bce58d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 11:34:32, skipping insertion in model container [2021-08-12 23:34:32,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 11:34:32" (1/1) ... [2021-08-12 23:34:32,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-12 23:34:33,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-12 23:34:33,229 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i[30694,30707] [2021-08-12 23:34:33,231 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i[30916,30929] [2021-08-12 23:34:33,240 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 23:34:33,246 INFO L203 MainTranslator]: Completed pre-run [2021-08-12 23:34:33,267 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i[30694,30707] [2021-08-12 23:34:33,267 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i[30916,30929] [2021-08-12 23:34:33,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 23:34:33,316 INFO L208 MainTranslator]: Completed translation [2021-08-12 23:34:33,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 11:34:33 WrapperNode [2021-08-12 23:34:33,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-12 23:34:33,318 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-12 23:34:33,318 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-12 23:34:33,318 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-12 23:34:33,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 11:34:33" (1/1) ... [2021-08-12 23:34:33,331 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 11:34:33" (1/1) ... [2021-08-12 23:34:33,349 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-12 23:34:33,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-12 23:34:33,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-12 23:34:33,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-12 23:34:33,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 11:34:33" (1/1) ... [2021-08-12 23:34:33,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 11:34:33" (1/1) ... [2021-08-12 23:34:33,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 11:34:33" (1/1) ... [2021-08-12 23:34:33,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 11:34:33" (1/1) ... [2021-08-12 23:34:33,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 11:34:33" (1/1) ... [2021-08-12 23:34:33,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 11:34:33" (1/1) ... [2021-08-12 23:34:33,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 11:34:33" (1/1) ... [2021-08-12 23:34:33,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-12 23:34:33,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-12 23:34:33,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-12 23:34:33,368 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-12 23:34:33,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 11:34:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-12 23:34:33,435 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader1 [2021-08-12 23:34:33,436 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader1 [2021-08-12 23:34:33,436 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader2 [2021-08-12 23:34:33,436 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader2 [2021-08-12 23:34:33,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-12 23:34:33,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-12 23:34:33,436 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_updater [2021-08-12 23:34:33,436 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_updater [2021-08-12 23:34:33,436 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-08-12 23:34:33,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-12 23:34:33,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-12 23:34:33,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-12 23:34:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-12 23:34:33,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-12 23:34:33,438 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-12 23:34:34,410 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-12 23:34:34,411 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-08-12 23:34:34,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 11:34:34 BoogieIcfgContainer [2021-08-12 23:34:34,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-12 23:34:34,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-12 23:34:34,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-12 23:34:34,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-12 23:34:34,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.08 11:34:32" (1/3) ... [2021-08-12 23:34:34,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2115d305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 11:34:34, skipping insertion in model container [2021-08-12 23:34:34,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 11:34:33" (2/3) ... [2021-08-12 23:34:34,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2115d305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 11:34:34, skipping insertion in model container [2021-08-12 23:34:34,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 11:34:34" (3/3) ... [2021-08-12 23:34:34,417 INFO L111 eAbstractionObserver]: Analyzing ICFG qrcu-1.i [2021-08-12 23:34:34,422 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-12 23:34:34,422 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-12 23:34:34,423 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-12 23:34:34,460 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,460 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,460 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,460 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,460 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,461 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,461 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,461 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,461 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,461 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,461 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,461 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,461 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,462 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,462 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,462 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,462 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,462 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,462 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,463 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,463 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,463 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,463 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,463 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,463 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,464 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,464 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,464 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,464 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,464 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,464 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,464 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,464 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,464 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,464 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,465 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,465 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,465 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,465 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,465 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,465 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,465 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,465 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,465 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,465 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,465 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,466 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,466 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,466 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,466 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,466 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,466 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,466 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,466 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,466 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,467 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,467 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,467 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,467 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,467 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,467 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,467 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,467 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,467 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,467 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,468 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,468 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,468 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,468 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,468 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,468 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,468 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,468 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,468 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,469 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,469 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,469 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,469 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,469 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,469 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,469 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,469 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,469 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,470 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,470 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,470 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,470 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,470 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,470 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,470 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,471 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,471 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,471 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,471 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,471 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,471 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,472 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,472 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,472 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,472 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,472 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,472 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,472 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,472 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,472 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,472 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,473 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,473 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,473 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,473 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,473 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,473 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,474 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,474 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,474 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,474 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,474 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,474 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,474 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,474 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,475 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,475 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,475 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,475 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,475 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,475 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,475 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,475 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,475 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,476 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,476 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,476 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,476 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,476 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,476 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,476 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,476 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,476 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,476 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,476 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,477 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,477 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,477 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,478 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,478 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,478 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,478 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,478 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,478 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,478 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,478 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,478 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,478 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,479 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,479 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,479 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,479 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,479 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,479 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,479 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,479 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,479 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,479 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,479 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,480 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,480 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,480 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,480 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,480 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,480 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,480 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,480 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,480 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,480 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,481 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,481 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,481 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,481 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,481 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,481 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,481 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,481 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,481 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,481 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,481 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,481 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,482 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,482 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,482 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,482 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,482 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,482 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,482 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,482 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,482 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,482 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,483 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,483 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,483 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,483 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,483 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,484 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,484 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,484 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,484 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,484 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,484 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,484 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,484 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,484 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,484 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,484 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,484 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,485 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,485 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,485 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,485 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,485 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,485 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,485 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,485 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,485 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,485 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,485 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,485 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,486 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,486 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,486 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,486 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,486 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,486 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,486 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,486 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,486 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,486 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,486 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,486 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,487 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,487 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,487 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,487 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,487 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,487 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,487 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,487 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,487 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,488 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,488 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,488 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,488 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,488 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,488 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,488 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,488 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,488 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,488 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,488 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,489 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,489 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,489 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,489 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,489 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,489 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,489 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,489 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,489 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,489 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,490 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,490 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,490 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,490 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,490 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,490 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,490 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,490 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,490 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,490 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,490 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,490 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,490 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,491 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,491 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,491 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,491 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,491 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,491 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,491 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,491 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,491 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,491 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,491 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,491 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,492 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,492 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,492 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,492 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,492 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,492 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,492 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,492 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,492 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,492 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,493 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,493 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,493 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,493 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,493 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,493 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,493 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,493 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,493 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,493 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,493 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,494 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,494 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,494 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,494 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,494 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,494 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,494 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,494 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,494 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,494 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,494 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,494 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,494 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,495 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,495 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,495 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,495 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,495 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,495 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,495 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,495 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,495 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,495 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,495 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,495 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,496 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,496 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,496 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,496 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,496 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,496 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,496 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,496 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,496 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,496 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,496 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,496 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,497 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,497 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,498 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,499 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,499 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,499 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,499 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,499 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,499 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,499 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,499 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,499 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,499 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,499 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,499 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,500 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,500 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,500 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,500 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,500 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,500 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,500 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,500 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,500 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,500 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,500 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,500 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,501 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,501 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,501 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,501 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,501 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,501 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,501 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork0_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,501 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,501 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,501 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,503 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,503 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,503 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,503 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,504 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,504 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,504 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,504 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,504 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,504 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,504 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,504 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,504 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,504 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,504 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,504 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,504 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,505 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,505 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,506 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,506 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,506 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,506 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,506 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,507 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,507 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,507 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,507 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,507 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,507 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,507 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,507 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,507 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,507 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,507 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,508 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,508 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,508 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 23:34:34,520 INFO L149 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2021-08-12 23:34:34,536 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-08-12 23:34:34,549 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-12 23:34:34,549 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-12 23:34:34,549 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-12 23:34:34,549 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-12 23:34:34,549 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-12 23:34:34,549 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-12 23:34:34,549 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-12 23:34:34,549 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-12 23:34:34,558 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 170 places, 184 transitions, 410 flow [2021-08-12 23:34:34,602 INFO L129 PetriNetUnfolder]: 23/192 cut-off events. [2021-08-12 23:34:34,603 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-08-12 23:34:34,607 INFO L84 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 192 events. 23/192 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 420 event pairs, 0 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 148. Up to 6 conditions per place. [2021-08-12 23:34:34,608 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 184 transitions, 410 flow [2021-08-12 23:34:34,612 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 168 transitions, 363 flow [2021-08-12 23:34:34,639 INFO L129 PetriNetUnfolder]: 10/124 cut-off events. [2021-08-12 23:34:34,640 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-08-12 23:34:34,640 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 23:34:34,640 INFO L266 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] [2021-08-12 23:34:34,641 INFO L430 AbstractCegarLoop]: === Iteration 1 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 23:34:34,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 23:34:34,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1400416887, now seen corresponding path program 1 times [2021-08-12 23:34:34,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 23:34:34,650 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404430609] [2021-08-12 23:34:34,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 23:34:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 23:34:34,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:34,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:34:34,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:34,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-08-12 23:34:34,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:34,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:34:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 23:34:34,863 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 23:34:34,863 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404430609] [2021-08-12 23:34:34,864 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404430609] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 23:34:34,864 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 23:34:34,864 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-12 23:34:34,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805640398] [2021-08-12 23:34:34,871 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-12 23:34:34,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 23:34:34,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-12 23:34:34,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 23:34:34,884 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 184 [2021-08-12 23:34:34,889 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 168 transitions, 363 flow. Second operand has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 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-08-12 23:34:34,889 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 23:34:34,889 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 184 [2021-08-12 23:34:34,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 23:34:34,986 INFO L129 PetriNetUnfolder]: 16/199 cut-off events. [2021-08-12 23:34:34,987 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-08-12 23:34:34,990 INFO L84 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 199 events. 16/199 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 499 event pairs, 0 based on Foata normal form. 28/209 useless extension candidates. Maximal degree in co-relation 182. Up to 13 conditions per place. [2021-08-12 23:34:34,992 INFO L132 encePairwiseOnDemand]: 175/184 looper letters, 13 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2021-08-12 23:34:34,992 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 163 transitions, 383 flow [2021-08-12 23:34:34,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-12 23:34:34,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-12 23:34:35,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2021-08-12 23:34:35,007 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9384057971014492 [2021-08-12 23:34:35,008 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2021-08-12 23:34:35,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2021-08-12 23:34:35,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 23:34:35,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2021-08-12 23:34:35,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 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-08-12 23:34:35,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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-08-12 23:34:35,028 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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-08-12 23:34:35,029 INFO L348 CegarLoopForPetriNet]: 156 programPoint places, 2 predicate places. [2021-08-12 23:34:35,029 INFO L482 AbstractCegarLoop]: Abstraction has has 158 places, 163 transitions, 383 flow [2021-08-12 23:34:35,029 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 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-08-12 23:34:35,029 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 23:34:35,030 INFO L266 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] [2021-08-12 23:34:35,031 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-12 23:34:35,033 INFO L430 AbstractCegarLoop]: === Iteration 2 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 23:34:35,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 23:34:35,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1483572956, now seen corresponding path program 1 times [2021-08-12 23:34:35,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 23:34:35,034 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632509962] [2021-08-12 23:34:35,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 23:34:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 23:34:35,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:35,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:34:35,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:35,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:34:35,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 23:34:35,109 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 23:34:35,109 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632509962] [2021-08-12 23:34:35,109 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632509962] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 23:34:35,109 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 23:34:35,109 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-12 23:34:35,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4761253] [2021-08-12 23:34:35,110 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-12 23:34:35,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 23:34:35,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-12 23:34:35,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 23:34:35,112 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 184 [2021-08-12 23:34:35,112 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 163 transitions, 383 flow. Second operand has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 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-08-12 23:34:35,112 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 23:34:35,112 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 184 [2021-08-12 23:34:35,112 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 23:34:35,148 INFO L129 PetriNetUnfolder]: 32/325 cut-off events. [2021-08-12 23:34:35,149 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-08-12 23:34:35,150 INFO L84 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 325 events. 32/325 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1287 event pairs, 3 based on Foata normal form. 2/297 useless extension candidates. Maximal degree in co-relation 319. Up to 23 conditions per place. [2021-08-12 23:34:35,151 INFO L132 encePairwiseOnDemand]: 181/184 looper letters, 4 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2021-08-12 23:34:35,151 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 164 transitions, 397 flow [2021-08-12 23:34:35,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-12 23:34:35,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-12 23:34:35,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2021-08-12 23:34:35,153 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9528985507246377 [2021-08-12 23:34:35,153 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 526 transitions. [2021-08-12 23:34:35,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 526 transitions. [2021-08-12 23:34:35,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 23:34:35,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 526 transitions. [2021-08-12 23:34:35,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 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-08-12 23:34:35,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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-08-12 23:34:35,156 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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-08-12 23:34:35,156 INFO L348 CegarLoopForPetriNet]: 156 programPoint places, 4 predicate places. [2021-08-12 23:34:35,156 INFO L482 AbstractCegarLoop]: Abstraction has has 160 places, 164 transitions, 397 flow [2021-08-12 23:34:35,157 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 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-08-12 23:34:35,157 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 23:34:35,157 INFO L266 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] [2021-08-12 23:34:35,157 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-12 23:34:35,157 INFO L430 AbstractCegarLoop]: === Iteration 3 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 23:34:35,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 23:34:35,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1909313479, now seen corresponding path program 1 times [2021-08-12 23:34:35,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 23:34:35,158 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654369002] [2021-08-12 23:34:35,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 23:34:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 23:34:35,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:35,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:34:35,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:35,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:34:35,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:35,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:34:35,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:35,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:34:35,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-08-12 23:34:35,230 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 23:34:35,230 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654369002] [2021-08-12 23:34:35,230 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654369002] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 23:34:35,231 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 23:34:35,231 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-12 23:34:35,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073561987] [2021-08-12 23:34:35,231 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-08-12 23:34:35,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 23:34:35,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-12 23:34:35,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-12 23:34:35,233 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 184 [2021-08-12 23:34:35,233 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 164 transitions, 397 flow. Second operand has 5 states, 5 states have (on average 155.4) internal successors, (777), 5 states have internal predecessors, (777), 0 states have call successors, (0), 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-08-12 23:34:35,233 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 23:34:35,234 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 184 [2021-08-12 23:34:35,234 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 23:34:35,618 INFO L129 PetriNetUnfolder]: 686/2495 cut-off events. [2021-08-12 23:34:35,618 INFO L130 PetriNetUnfolder]: For 123/123 co-relation queries the response was YES. [2021-08-12 23:34:35,626 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3902 conditions, 2495 events. 686/2495 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 21215 event pairs, 223 based on Foata normal form. 0/2242 useless extension candidates. Maximal degree in co-relation 3669. Up to 525 conditions per place. [2021-08-12 23:34:35,636 INFO L132 encePairwiseOnDemand]: 177/184 looper letters, 48 selfloop transitions, 12 changer transitions 1/198 dead transitions. [2021-08-12 23:34:35,636 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 198 transitions, 596 flow [2021-08-12 23:34:35,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-12 23:34:35,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-08-12 23:34:35,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1125 transitions. [2021-08-12 23:34:35,638 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8734472049689441 [2021-08-12 23:34:35,638 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1125 transitions. [2021-08-12 23:34:35,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1125 transitions. [2021-08-12 23:34:35,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 23:34:35,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1125 transitions. [2021-08-12 23:34:35,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 160.71428571428572) internal successors, (1125), 7 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-08-12 23:34:35,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 0 states have call successors, (0), 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-08-12 23:34:35,644 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 0 states have call successors, (0), 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-08-12 23:34:35,644 INFO L348 CegarLoopForPetriNet]: 156 programPoint places, 10 predicate places. [2021-08-12 23:34:35,644 INFO L482 AbstractCegarLoop]: Abstraction has has 166 places, 198 transitions, 596 flow [2021-08-12 23:34:35,644 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 155.4) internal successors, (777), 5 states have internal predecessors, (777), 0 states have call successors, (0), 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-08-12 23:34:35,644 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 23:34:35,644 INFO L266 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] [2021-08-12 23:34:35,644 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-12 23:34:35,645 INFO L430 AbstractCegarLoop]: === Iteration 4 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 23:34:35,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 23:34:35,645 INFO L82 PathProgramCache]: Analyzing trace with hash 49287331, now seen corresponding path program 1 times [2021-08-12 23:34:35,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 23:34:35,645 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231941298] [2021-08-12 23:34:35,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 23:34:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 23:34:35,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:35,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:34:35,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:35,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-08-12 23:34:35,717 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-08-12 23:34:35,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:34:35,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:35,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:34:35,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:35,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:34:35,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:35,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 23:34:35,755 INFO L142 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-08-12 23:34:35,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:34:35,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:35,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:34:35,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 23:34:35,759 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 23:34:35,759 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231941298] [2021-08-12 23:34:35,759 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231941298] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 23:34:35,759 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 23:34:35,759 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 23:34:35,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817145139] [2021-08-12 23:34:35,760 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 23:34:35,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 23:34:35,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 23:34:35,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-12 23:34:35,762 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 184 [2021-08-12 23:34:35,763 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 198 transitions, 596 flow. Second operand has 6 states, 6 states have (on average 145.83333333333334) internal successors, (875), 6 states have internal predecessors, (875), 0 states have call successors, (0), 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-08-12 23:34:35,763 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 23:34:35,763 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 184 [2021-08-12 23:34:35,763 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 23:34:36,774 INFO L129 PetriNetUnfolder]: 2641/6557 cut-off events. [2021-08-12 23:34:36,774 INFO L130 PetriNetUnfolder]: For 585/590 co-relation queries the response was YES. [2021-08-12 23:34:36,796 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12177 conditions, 6557 events. 2641/6557 cut-off events. For 585/590 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 61326 event pairs, 327 based on Foata normal form. 211/6220 useless extension candidates. Maximal degree in co-relation 11732. Up to 2128 conditions per place. [2021-08-12 23:34:36,825 INFO L132 encePairwiseOnDemand]: 166/184 looper letters, 76 selfloop transitions, 31 changer transitions 1/269 dead transitions. [2021-08-12 23:34:36,825 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 269 transitions, 1037 flow [2021-08-12 23:34:36,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-12 23:34:36,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-08-12 23:34:36,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1267 transitions. [2021-08-12 23:34:36,828 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.860733695652174 [2021-08-12 23:34:36,828 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1267 transitions. [2021-08-12 23:34:36,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1267 transitions. [2021-08-12 23:34:36,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 23:34:36,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1267 transitions. [2021-08-12 23:34:36,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 158.375) internal successors, (1267), 8 states have internal predecessors, (1267), 0 states have call successors, (0), 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-08-12 23:34:36,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 184.0) internal successors, (1656), 9 states have internal predecessors, (1656), 0 states have call successors, (0), 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-08-12 23:34:36,833 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 184.0) internal successors, (1656), 9 states have internal predecessors, (1656), 0 states have call successors, (0), 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-08-12 23:34:36,834 INFO L348 CegarLoopForPetriNet]: 156 programPoint places, 17 predicate places. [2021-08-12 23:34:36,834 INFO L482 AbstractCegarLoop]: Abstraction has has 173 places, 269 transitions, 1037 flow [2021-08-12 23:34:36,835 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 145.83333333333334) internal successors, (875), 6 states have internal predecessors, (875), 0 states have call successors, (0), 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-08-12 23:34:36,835 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 23:34:36,835 INFO L266 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] [2021-08-12 23:34:36,835 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-12 23:34:36,836 INFO L430 AbstractCegarLoop]: === Iteration 5 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 23:34:36,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 23:34:36,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1352231797, now seen corresponding path program 2 times [2021-08-12 23:34:36,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 23:34:36,837 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403283764] [2021-08-12 23:34:36,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 23:34:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 23:34:36,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:36,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:34:36,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:36,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:34:36,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:36,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 23:34:36,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:36,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-08-12 23:34:36,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:36,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:34:36,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:36,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:34:36,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 23:34:36,923 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 23:34:36,923 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403283764] [2021-08-12 23:34:36,923 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403283764] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 23:34:36,923 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 23:34:36,923 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 23:34:36,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556331033] [2021-08-12 23:34:36,923 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 23:34:36,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 23:34:36,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 23:34:36,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-12 23:34:36,925 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 184 [2021-08-12 23:34:36,926 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 269 transitions, 1037 flow. Second operand has 7 states, 7 states have (on average 142.57142857142858) internal successors, (998), 7 states have internal predecessors, (998), 0 states have call successors, (0), 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-08-12 23:34:36,926 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 23:34:36,926 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 184 [2021-08-12 23:34:36,926 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 23:34:38,467 INFO L129 PetriNetUnfolder]: 6801/15282 cut-off events. [2021-08-12 23:34:38,467 INFO L130 PetriNetUnfolder]: For 4573/4964 co-relation queries the response was YES. [2021-08-12 23:34:38,528 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33420 conditions, 15282 events. 6801/15282 cut-off events. For 4573/4964 co-relation queries the response was YES. Maximal size of possible extension queue 654. Compared 155881 event pairs, 1142 based on Foata normal form. 121/13959 useless extension candidates. Maximal degree in co-relation 32242. Up to 4049 conditions per place. [2021-08-12 23:34:38,644 INFO L132 encePairwiseOnDemand]: 174/184 looper letters, 134 selfloop transitions, 23 changer transitions 4/364 dead transitions. [2021-08-12 23:34:38,644 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 364 transitions, 1742 flow [2021-08-12 23:34:38,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-12 23:34:38,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-12 23:34:38,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1473 transitions. [2021-08-12 23:34:38,647 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8005434782608696 [2021-08-12 23:34:38,647 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1473 transitions. [2021-08-12 23:34:38,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1473 transitions. [2021-08-12 23:34:38,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 23:34:38,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1473 transitions. [2021-08-12 23:34:38,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 147.3) internal successors, (1473), 10 states have internal predecessors, (1473), 0 states have call successors, (0), 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-08-12 23:34:38,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 184.0) internal successors, (2024), 11 states have internal predecessors, (2024), 0 states have call successors, (0), 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-08-12 23:34:38,652 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 184.0) internal successors, (2024), 11 states have internal predecessors, (2024), 0 states have call successors, (0), 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-08-12 23:34:38,652 INFO L348 CegarLoopForPetriNet]: 156 programPoint places, 26 predicate places. [2021-08-12 23:34:38,653 INFO L482 AbstractCegarLoop]: Abstraction has has 182 places, 364 transitions, 1742 flow [2021-08-12 23:34:38,653 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 142.57142857142858) internal successors, (998), 7 states have internal predecessors, (998), 0 states have call successors, (0), 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-08-12 23:34:38,653 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 23:34:38,653 INFO L266 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] [2021-08-12 23:34:38,653 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-12 23:34:38,653 INFO L430 AbstractCegarLoop]: === Iteration 6 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 23:34:38,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 23:34:38,654 INFO L82 PathProgramCache]: Analyzing trace with hash -588655955, now seen corresponding path program 1 times [2021-08-12 23:34:38,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 23:34:38,654 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606675267] [2021-08-12 23:34:38,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 23:34:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 23:34:38,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:38,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:34:38,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:38,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-08-12 23:34:38,691 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-08-12 23:34:38,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:34:38,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:38,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:34:38,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:38,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:34:38,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:38,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:34:38,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:38,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:34:38,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 23:34:38,728 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 23:34:38,728 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606675267] [2021-08-12 23:34:38,728 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606675267] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 23:34:38,728 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 23:34:38,728 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 23:34:38,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771275344] [2021-08-12 23:34:38,729 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 23:34:38,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 23:34:38,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 23:34:38,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-12 23:34:38,730 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 184 [2021-08-12 23:34:38,730 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 364 transitions, 1742 flow. Second operand has 7 states, 7 states have (on average 145.57142857142858) internal successors, (1019), 7 states have internal predecessors, (1019), 0 states have call successors, (0), 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-08-12 23:34:38,731 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 23:34:38,731 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 184 [2021-08-12 23:34:38,731 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 23:34:40,218 INFO L129 PetriNetUnfolder]: 6431/14375 cut-off events. [2021-08-12 23:34:40,218 INFO L130 PetriNetUnfolder]: For 5968/6681 co-relation queries the response was YES. [2021-08-12 23:34:40,283 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36529 conditions, 14375 events. 6431/14375 cut-off events. For 5968/6681 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 145332 event pairs, 912 based on Foata normal form. 145/13158 useless extension candidates. Maximal degree in co-relation 31821. Up to 4130 conditions per place. [2021-08-12 23:34:40,348 INFO L132 encePairwiseOnDemand]: 163/184 looper letters, 99 selfloop transitions, 37 changer transitions 3/390 dead transitions. [2021-08-12 23:34:40,348 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 390 transitions, 2134 flow [2021-08-12 23:34:40,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-12 23:34:40,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-12 23:34:40,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1555 transitions. [2021-08-12 23:34:40,351 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.845108695652174 [2021-08-12 23:34:40,352 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1555 transitions. [2021-08-12 23:34:40,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1555 transitions. [2021-08-12 23:34:40,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 23:34:40,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1555 transitions. [2021-08-12 23:34:40,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 155.5) internal successors, (1555), 10 states have internal predecessors, (1555), 0 states have call successors, (0), 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-08-12 23:34:40,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 184.0) internal successors, (2024), 11 states have internal predecessors, (2024), 0 states have call successors, (0), 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-08-12 23:34:40,357 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 184.0) internal successors, (2024), 11 states have internal predecessors, (2024), 0 states have call successors, (0), 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-08-12 23:34:40,358 INFO L348 CegarLoopForPetriNet]: 156 programPoint places, 35 predicate places. [2021-08-12 23:34:40,358 INFO L482 AbstractCegarLoop]: Abstraction has has 191 places, 390 transitions, 2134 flow [2021-08-12 23:34:40,359 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 145.57142857142858) internal successors, (1019), 7 states have internal predecessors, (1019), 0 states have call successors, (0), 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-08-12 23:34:40,359 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 23:34:40,359 INFO L266 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] [2021-08-12 23:34:40,359 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-12 23:34:40,359 INFO L430 AbstractCegarLoop]: === Iteration 7 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 23:34:40,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 23:34:40,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1975998775, now seen corresponding path program 1 times [2021-08-12 23:34:40,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 23:34:40,360 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617985143] [2021-08-12 23:34:40,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 23:34:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 23:34:40,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:40,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:34:40,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:40,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:34:40,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 23:34:40,410 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 23:34:40,410 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617985143] [2021-08-12 23:34:40,410 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617985143] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 23:34:40,410 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 23:34:40,410 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-12 23:34:40,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683104813] [2021-08-12 23:34:40,411 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-12 23:34:40,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 23:34:40,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-12 23:34:40,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 23:34:40,412 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 184 [2021-08-12 23:34:40,503 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 390 transitions, 2134 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 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-08-12 23:34:40,504 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 23:34:40,504 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 184 [2021-08-12 23:34:40,504 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 23:34:41,641 INFO L129 PetriNetUnfolder]: 6205/14002 cut-off events. [2021-08-12 23:34:41,641 INFO L130 PetriNetUnfolder]: For 7134/7726 co-relation queries the response was YES. [2021-08-12 23:34:41,692 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35881 conditions, 14002 events. 6205/14002 cut-off events. For 7134/7726 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 142239 event pairs, 859 based on Foata normal form. 72/12733 useless extension candidates. Maximal degree in co-relation 34556. Up to 3889 conditions per place. [2021-08-12 23:34:41,737 INFO L132 encePairwiseOnDemand]: 182/184 looper letters, 14 selfloop transitions, 3 changer transitions 4/392 dead transitions. [2021-08-12 23:34:41,738 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 392 transitions, 2184 flow [2021-08-12 23:34:41,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-12 23:34:41,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-12 23:34:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2021-08-12 23:34:41,739 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9528985507246377 [2021-08-12 23:34:41,739 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 526 transitions. [2021-08-12 23:34:41,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 526 transitions. [2021-08-12 23:34:41,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 23:34:41,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 526 transitions. [2021-08-12 23:34:41,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 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-08-12 23:34:41,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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-08-12 23:34:41,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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-08-12 23:34:41,741 INFO L348 CegarLoopForPetriNet]: 156 programPoint places, 37 predicate places. [2021-08-12 23:34:41,741 INFO L482 AbstractCegarLoop]: Abstraction has has 193 places, 392 transitions, 2184 flow [2021-08-12 23:34:41,742 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 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-08-12 23:34:41,742 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 23:34:41,742 INFO L266 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] [2021-08-12 23:34:41,742 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-12 23:34:41,742 INFO L430 AbstractCegarLoop]: === Iteration 8 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 23:34:41,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 23:34:41,742 INFO L82 PathProgramCache]: Analyzing trace with hash -413653959, now seen corresponding path program 1 times [2021-08-12 23:34:41,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 23:34:41,742 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254479873] [2021-08-12 23:34:41,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 23:34:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 23:34:41,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:41,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:34:41,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:41,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:34:41,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:41,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:34:41,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:41,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:34:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 23:34:41,777 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 23:34:41,777 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254479873] [2021-08-12 23:34:41,777 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254479873] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 23:34:41,777 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 23:34:41,777 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-12 23:34:41,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083666820] [2021-08-12 23:34:41,778 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-08-12 23:34:41,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 23:34:41,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-12 23:34:41,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-12 23:34:41,779 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 184 [2021-08-12 23:34:41,779 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 392 transitions, 2184 flow. Second operand has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 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-08-12 23:34:41,779 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 23:34:41,779 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 184 [2021-08-12 23:34:41,780 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 23:34:42,160 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([623] L788-->L788-1: Formula: (= |v_ULTIMATE.start_main_#t~mem31_2| (select (select |v_#memory_int_19| |v_ULTIMATE.start_main_~#t2~0.base_4|) |v_ULTIMATE.start_main_~#t2~0.offset_4|)) InVars {ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|} OutVars{ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|, ULTIMATE.start_main_#t~mem31=|v_ULTIMATE.start_main_#t~mem31_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem31][293], [96#L763-1true, 194#true, 169#true, 171#true, 172#true, 205#true, 174#true, 241#(= ~readerprogress1~0 2), 178#true, 245#(= ~readerprogress2~0 2), 53#L788-1true, 182#true, 58#L758true, 223#true]) [2021-08-12 23:34:42,160 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2021-08-12 23:34:42,160 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:34:42,160 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:34:42,160 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:34:43,525 INFO L129 PetriNetUnfolder]: 7609/17070 cut-off events. [2021-08-12 23:34:43,525 INFO L130 PetriNetUnfolder]: For 14023/17002 co-relation queries the response was YES. [2021-08-12 23:34:43,605 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49337 conditions, 17070 events. 7609/17070 cut-off events. For 14023/17002 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 179530 event pairs, 745 based on Foata normal form. 128/15773 useless extension candidates. Maximal degree in co-relation 47759. Up to 4885 conditions per place. [2021-08-12 23:34:43,661 INFO L132 encePairwiseOnDemand]: 178/184 looper letters, 215 selfloop transitions, 12 changer transitions 18/492 dead transitions. [2021-08-12 23:34:43,661 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 492 transitions, 3301 flow [2021-08-12 23:34:43,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-12 23:34:43,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-08-12 23:34:43,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 813 transitions. [2021-08-12 23:34:43,663 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.883695652173913 [2021-08-12 23:34:43,663 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 813 transitions. [2021-08-12 23:34:43,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 813 transitions. [2021-08-12 23:34:43,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 23:34:43,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 813 transitions. [2021-08-12 23:34:43,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 162.6) internal successors, (813), 5 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-08-12 23:34:43,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 0 states have call successors, (0), 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-08-12 23:34:43,666 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 0 states have call successors, (0), 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-08-12 23:34:43,666 INFO L348 CegarLoopForPetriNet]: 156 programPoint places, 41 predicate places. [2021-08-12 23:34:43,666 INFO L482 AbstractCegarLoop]: Abstraction has has 197 places, 492 transitions, 3301 flow [2021-08-12 23:34:43,666 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 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-08-12 23:34:43,666 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 23:34:43,667 INFO L266 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] [2021-08-12 23:34:43,667 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-12 23:34:43,667 INFO L430 AbstractCegarLoop]: === Iteration 9 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 23:34:43,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 23:34:43,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1865929570, now seen corresponding path program 1 times [2021-08-12 23:34:43,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 23:34:43,667 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365065281] [2021-08-12 23:34:43,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 23:34:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 23:34:43,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:43,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:34:43,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:43,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:34:43,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:43,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:34:43,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 23:34:43,695 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 23:34:43,695 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365065281] [2021-08-12 23:34:43,695 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365065281] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 23:34:43,696 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 23:34:43,696 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-12 23:34:43,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152969124] [2021-08-12 23:34:43,696 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-12 23:34:43,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 23:34:43,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-12 23:34:43,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 23:34:43,697 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 184 [2021-08-12 23:34:43,697 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 492 transitions, 3301 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 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-08-12 23:34:43,697 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 23:34:43,697 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 184 [2021-08-12 23:34:43,697 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 23:34:44,044 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([623] L788-->L788-1: Formula: (= |v_ULTIMATE.start_main_#t~mem31_2| (select (select |v_#memory_int_19| |v_ULTIMATE.start_main_~#t2~0.base_4|) |v_ULTIMATE.start_main_~#t2~0.offset_4|)) InVars {ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|} OutVars{ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|, ULTIMATE.start_main_#t~mem31=|v_ULTIMATE.start_main_#t~mem31_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem31][281], [96#L763-1true, 194#true, 169#true, 171#true, 172#true, 205#true, 174#true, 241#(= ~readerprogress1~0 2), 178#true, 53#L788-1true, 245#(= ~readerprogress2~0 2), 182#true, 58#L758true, 223#true, 255#(= ~idx~0 0)]) [2021-08-12 23:34:44,044 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2021-08-12 23:34:44,044 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:34:44,045 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:34:44,045 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:34:45,324 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem22_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_#t~mem22=|v_qrcu_updaterThread1of1ForFork0_#t~mem22_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_5|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem22][369], [194#true, 229#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 70#L777true, 169#true, 171#true, 173#true, 176#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), 241#(= ~readerprogress1~0 2), 178#true, 19#L739true, 51#L758-3true, 245#(= ~readerprogress2~0 2), 121#L787-1true, 185#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), 221#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem22| 0)), 253#true]) [2021-08-12 23:34:45,324 INFO L384 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2021-08-12 23:34:45,324 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-08-12 23:34:45,324 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-08-12 23:34:45,324 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-08-12 23:34:45,450 INFO L129 PetriNetUnfolder]: 7972/18225 cut-off events. [2021-08-12 23:34:45,450 INFO L130 PetriNetUnfolder]: For 15479/18590 co-relation queries the response was YES. [2021-08-12 23:34:45,537 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53012 conditions, 18225 events. 7972/18225 cut-off events. For 15479/18590 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 193820 event pairs, 825 based on Foata normal form. 22/16676 useless extension candidates. Maximal degree in co-relation 51222. Up to 4580 conditions per place. [2021-08-12 23:34:45,593 INFO L132 encePairwiseOnDemand]: 181/184 looper letters, 7 selfloop transitions, 2 changer transitions 18/470 dead transitions. [2021-08-12 23:34:45,593 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 470 transitions, 3195 flow [2021-08-12 23:34:45,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-12 23:34:45,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-12 23:34:45,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions. [2021-08-12 23:34:45,594 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9365942028985508 [2021-08-12 23:34:45,594 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 517 transitions. [2021-08-12 23:34:45,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 517 transitions. [2021-08-12 23:34:45,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 23:34:45,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 517 transitions. [2021-08-12 23:34:45,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 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-08-12 23:34:45,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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-08-12 23:34:45,596 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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-08-12 23:34:45,597 INFO L348 CegarLoopForPetriNet]: 156 programPoint places, 35 predicate places. [2021-08-12 23:34:45,597 INFO L482 AbstractCegarLoop]: Abstraction has has 191 places, 470 transitions, 3195 flow [2021-08-12 23:34:45,597 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 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-08-12 23:34:45,597 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 23:34:45,597 INFO L266 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] [2021-08-12 23:34:45,597 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-12 23:34:45,597 INFO L430 AbstractCegarLoop]: === Iteration 10 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 23:34:45,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 23:34:45,597 INFO L82 PathProgramCache]: Analyzing trace with hash 2143862336, now seen corresponding path program 1 times [2021-08-12 23:34:45,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 23:34:45,598 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226716440] [2021-08-12 23:34:45,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 23:34:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 23:34:45,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:45,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:34:45,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:45,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-08-12 23:34:45,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:45,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:34:45,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 23:34:45,617 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 23:34:45,617 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226716440] [2021-08-12 23:34:45,618 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226716440] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 23:34:45,618 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 23:34:45,618 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-12 23:34:45,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373536599] [2021-08-12 23:34:45,618 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-12 23:34:45,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 23:34:45,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-12 23:34:45,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 23:34:45,619 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 184 [2021-08-12 23:34:45,619 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 470 transitions, 3195 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 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-08-12 23:34:45,619 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 23:34:45,619 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 184 [2021-08-12 23:34:45,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 23:34:45,861 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([623] L788-->L788-1: Formula: (= |v_ULTIMATE.start_main_#t~mem31_2| (select (select |v_#memory_int_19| |v_ULTIMATE.start_main_~#t2~0.base_4|) |v_ULTIMATE.start_main_~#t2~0.offset_4|)) InVars {ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|} OutVars{ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|, ULTIMATE.start_main_#t~mem31=|v_ULTIMATE.start_main_#t~mem31_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem31][278], [96#L763-1true, 257#true, 194#true, 169#true, 171#true, 172#true, 205#true, 174#true, 241#(= ~readerprogress1~0 2), 178#true, 53#L788-1true, 245#(= ~readerprogress2~0 2), 182#true, 58#L758true, 223#true, 255#(= ~idx~0 0)]) [2021-08-12 23:34:45,861 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2021-08-12 23:34:45,861 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:34:45,861 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:34:45,861 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:34:47,293 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem22_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_#t~mem22=|v_qrcu_updaterThread1of1ForFork0_#t~mem22_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_5|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem22][366], [194#true, 259#(= ~idx~0 1), 229#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 70#L777true, 169#true, 171#true, 173#true, 176#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), 241#(= ~readerprogress1~0 2), 178#true, 19#L739true, 51#L758-3true, 245#(= ~readerprogress2~0 2), 121#L787-1true, 185#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), 253#true, 221#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem22| 0))]) [2021-08-12 23:34:47,294 INFO L384 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2021-08-12 23:34:47,294 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-08-12 23:34:47,294 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-08-12 23:34:47,294 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-08-12 23:34:47,434 INFO L129 PetriNetUnfolder]: 7688/17824 cut-off events. [2021-08-12 23:34:47,434 INFO L130 PetriNetUnfolder]: For 15741/18936 co-relation queries the response was YES. [2021-08-12 23:34:47,523 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52486 conditions, 17824 events. 7688/17824 cut-off events. For 15741/18936 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 191242 event pairs, 825 based on Foata normal form. 52/16539 useless extension candidates. Maximal degree in co-relation 50694. Up to 4346 conditions per place. [2021-08-12 23:34:47,579 INFO L132 encePairwiseOnDemand]: 182/184 looper letters, 7 selfloop transitions, 1 changer transitions 18/467 dead transitions. [2021-08-12 23:34:47,580 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 467 transitions, 3195 flow [2021-08-12 23:34:47,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-12 23:34:47,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-12 23:34:47,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 516 transitions. [2021-08-12 23:34:47,581 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9347826086956522 [2021-08-12 23:34:47,581 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 516 transitions. [2021-08-12 23:34:47,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 516 transitions. [2021-08-12 23:34:47,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 23:34:47,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 516 transitions. [2021-08-12 23:34:47,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 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-08-12 23:34:47,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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-08-12 23:34:47,583 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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-08-12 23:34:47,583 INFO L348 CegarLoopForPetriNet]: 156 programPoint places, 36 predicate places. [2021-08-12 23:34:47,583 INFO L482 AbstractCegarLoop]: Abstraction has has 192 places, 467 transitions, 3195 flow [2021-08-12 23:34:47,584 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 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-08-12 23:34:47,584 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 23:34:47,584 INFO L266 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] [2021-08-12 23:34:47,584 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-12 23:34:47,584 INFO L430 AbstractCegarLoop]: === Iteration 11 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 23:34:47,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 23:34:47,584 INFO L82 PathProgramCache]: Analyzing trace with hash -558620228, now seen corresponding path program 1 times [2021-08-12 23:34:47,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 23:34:47,584 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891104520] [2021-08-12 23:34:47,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 23:34:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 23:34:47,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:47,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:34:47,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:47,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:34:47,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:47,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:34:47,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:47,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:34:47,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:47,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:34:47,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 23:34:47,619 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 23:34:47,619 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891104520] [2021-08-12 23:34:47,619 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891104520] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 23:34:47,619 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 23:34:47,619 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-12 23:34:47,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123800613] [2021-08-12 23:34:47,619 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-08-12 23:34:47,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 23:34:47,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-12 23:34:47,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-12 23:34:47,620 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 184 [2021-08-12 23:34:47,621 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 467 transitions, 3195 flow. Second operand has 5 states, 5 states have (on average 162.4) internal successors, (812), 5 states have internal predecessors, (812), 0 states have call successors, (0), 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-08-12 23:34:47,621 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 23:34:47,621 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 184 [2021-08-12 23:34:47,621 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 23:34:48,018 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([623] L788-->L788-1: Formula: (= |v_ULTIMATE.start_main_#t~mem31_2| (select (select |v_#memory_int_19| |v_ULTIMATE.start_main_~#t2~0.base_4|) |v_ULTIMATE.start_main_~#t2~0.offset_4|)) InVars {ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|} OutVars{ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|, ULTIMATE.start_main_#t~mem31=|v_ULTIMATE.start_main_#t~mem31_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem31][284], [96#L763-1true, 257#true, 194#true, 261#true, 169#true, 171#true, 172#true, 205#true, 174#true, 241#(= ~readerprogress1~0 2), 178#true, 53#L788-1true, 245#(= ~readerprogress2~0 2), 182#true, 58#L758true, 223#true, 255#(= ~idx~0 0)]) [2021-08-12 23:34:48,018 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2021-08-12 23:34:48,018 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:34:48,019 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:34:48,019 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:34:49,931 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem22_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_#t~mem22=|v_qrcu_updaterThread1of1ForFork0_#t~mem22_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_5|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem22][396], [194#true, 259#(= ~idx~0 1), 229#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 261#true, 70#L777true, 169#true, 171#true, 173#true, 176#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), 241#(= ~readerprogress1~0 2), 178#true, 51#L758-3true, 19#L739true, 245#(= ~readerprogress2~0 2), 121#L787-1true, 185#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), 253#true, 221#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem22| 0))]) [2021-08-12 23:34:49,931 INFO L384 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2021-08-12 23:34:49,931 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-08-12 23:34:49,931 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-08-12 23:34:49,931 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-08-12 23:34:50,096 INFO L129 PetriNetUnfolder]: 8924/20697 cut-off events. [2021-08-12 23:34:50,096 INFO L130 PetriNetUnfolder]: For 23763/28158 co-relation queries the response was YES. [2021-08-12 23:34:50,183 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65389 conditions, 20697 events. 8924/20697 cut-off events. For 23763/28158 co-relation queries the response was YES. Maximal size of possible extension queue 901. Compared 229145 event pairs, 848 based on Foata normal form. 142/19213 useless extension candidates. Maximal degree in co-relation 63446. Up to 5714 conditions per place. [2021-08-12 23:34:50,237 INFO L132 encePairwiseOnDemand]: 174/184 looper letters, 59 selfloop transitions, 36 changer transitions 14/499 dead transitions. [2021-08-12 23:34:50,237 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 499 transitions, 3609 flow [2021-08-12 23:34:50,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-12 23:34:50,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-08-12 23:34:50,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1179 transitions. [2021-08-12 23:34:50,239 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9153726708074534 [2021-08-12 23:34:50,240 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1179 transitions. [2021-08-12 23:34:50,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1179 transitions. [2021-08-12 23:34:50,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 23:34:50,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1179 transitions. [2021-08-12 23:34:50,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 168.42857142857142) internal successors, (1179), 7 states have internal predecessors, (1179), 0 states have call successors, (0), 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-08-12 23:34:50,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 0 states have call successors, (0), 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-08-12 23:34:50,243 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 0 states have call successors, (0), 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-08-12 23:34:50,243 INFO L348 CegarLoopForPetriNet]: 156 programPoint places, 42 predicate places. [2021-08-12 23:34:50,243 INFO L482 AbstractCegarLoop]: Abstraction has has 198 places, 499 transitions, 3609 flow [2021-08-12 23:34:50,244 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 162.4) internal successors, (812), 5 states have internal predecessors, (812), 0 states have call successors, (0), 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-08-12 23:34:50,244 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 23:34:50,244 INFO L266 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] [2021-08-12 23:34:50,244 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-12 23:34:50,244 INFO L430 AbstractCegarLoop]: === Iteration 12 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 23:34:50,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 23:34:50,244 INFO L82 PathProgramCache]: Analyzing trace with hash -427685141, now seen corresponding path program 1 times [2021-08-12 23:34:50,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 23:34:50,244 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785832485] [2021-08-12 23:34:50,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 23:34:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 23:34:50,272 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:50,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:34:50,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:50,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:34:50,276 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-08-12 23:34:50,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:34:50,280 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-08-12 23:34:50,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:34:50,287 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-08-12 23:34:50,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:34:50,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:50,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:34:50,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:50,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:34:50,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:50,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:34:50,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:50,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:34:50,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:50,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 23:34:50,329 INFO L142 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-08-12 23:34:50,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:34:50,330 INFO L142 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-08-12 23:34:50,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:34:50,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:50,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:34:50,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 23:34:50,331 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 23:34:50,331 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785832485] [2021-08-12 23:34:50,331 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785832485] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 23:34:50,331 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 23:34:50,331 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-12 23:34:50,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490315426] [2021-08-12 23:34:50,331 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-12 23:34:50,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 23:34:50,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-12 23:34:50,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-08-12 23:34:50,333 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 184 [2021-08-12 23:34:50,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 499 transitions, 3609 flow. Second operand has 10 states, 10 states have (on average 134.8) internal successors, (1348), 10 states have internal predecessors, (1348), 0 states have call successors, (0), 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-08-12 23:34:50,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 23:34:50,334 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 184 [2021-08-12 23:34:50,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 23:34:54,326 INFO L129 PetriNetUnfolder]: 12587/27989 cut-off events. [2021-08-12 23:34:54,326 INFO L130 PetriNetUnfolder]: For 44736/50116 co-relation queries the response was YES. [2021-08-12 23:34:54,458 INFO L84 FinitePrefix]: Finished finitePrefix Result has 97211 conditions, 27989 events. 12587/27989 cut-off events. For 44736/50116 co-relation queries the response was YES. Maximal size of possible extension queue 1149. Compared 308265 event pairs, 1000 based on Foata normal form. 316/26308 useless extension candidates. Maximal degree in co-relation 94716. Up to 7456 conditions per place. [2021-08-12 23:34:54,514 INFO L132 encePairwiseOnDemand]: 167/184 looper letters, 254 selfloop transitions, 102 changer transitions 50/694 dead transitions. [2021-08-12 23:34:54,515 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 694 transitions, 5932 flow [2021-08-12 23:34:54,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-12 23:34:54,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-08-12 23:34:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2205 transitions. [2021-08-12 23:34:54,518 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.7989130434782609 [2021-08-12 23:34:54,518 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2205 transitions. [2021-08-12 23:34:54,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2205 transitions. [2021-08-12 23:34:54,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 23:34:54,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2205 transitions. [2021-08-12 23:34:54,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 147.0) internal successors, (2205), 15 states have internal predecessors, (2205), 0 states have call successors, (0), 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-08-12 23:34:54,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 184.0) internal successors, (2944), 16 states have internal predecessors, (2944), 0 states have call successors, (0), 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-08-12 23:34:54,525 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 184.0) internal successors, (2944), 16 states have internal predecessors, (2944), 0 states have call successors, (0), 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-08-12 23:34:54,525 INFO L348 CegarLoopForPetriNet]: 156 programPoint places, 56 predicate places. [2021-08-12 23:34:54,525 INFO L482 AbstractCegarLoop]: Abstraction has has 212 places, 694 transitions, 5932 flow [2021-08-12 23:34:54,525 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 134.8) internal successors, (1348), 10 states have internal predecessors, (1348), 0 states have call successors, (0), 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-08-12 23:34:54,525 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 23:34:54,526 INFO L266 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] [2021-08-12 23:34:54,526 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-12 23:34:54,526 INFO L430 AbstractCegarLoop]: === Iteration 13 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 23:34:54,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 23:34:54,526 INFO L82 PathProgramCache]: Analyzing trace with hash 749575133, now seen corresponding path program 1 times [2021-08-12 23:34:54,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 23:34:54,526 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109421747] [2021-08-12 23:34:54,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 23:34:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 23:34:54,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:54,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:34:54,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:54,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:34:54,555 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-08-12 23:34:54,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:34:54,559 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-08-12 23:34:54,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:34:54,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:54,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:34:54,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:54,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:34:54,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:54,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:34:54,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:54,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:34:54,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:54,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:34:54,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:54,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:34:54,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:54,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:34:54,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 23:34:54,607 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 23:34:54,607 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109421747] [2021-08-12 23:34:54,607 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109421747] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 23:34:54,607 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 23:34:54,607 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-12 23:34:54,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727354026] [2021-08-12 23:34:54,607 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-12 23:34:54,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 23:34:54,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-12 23:34:54,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-08-12 23:34:54,609 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 184 [2021-08-12 23:34:54,619 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 694 transitions, 5932 flow. Second operand has 11 states, 11 states have (on average 134.63636363636363) internal successors, (1481), 11 states have internal predecessors, (1481), 0 states have call successors, (0), 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-08-12 23:34:54,620 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 23:34:54,620 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 184 [2021-08-12 23:34:54,620 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 23:34:58,782 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem22_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_#t~mem22=|v_qrcu_updaterThread1of1ForFork0_#t~mem22_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_5|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem22][699], [194#true, 259#(= ~idx~0 1), 229#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 261#true, 70#L777true, 169#true, 171#true, 173#true, 271#true, 176#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), 241#(= ~readerprogress1~0 2), 178#true, 51#L758-3true, 19#L739true, 245#(= ~readerprogress2~0 2), 312#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 121#L787-1true, 185#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), 221#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem22| 0)), 253#true]) [2021-08-12 23:34:58,782 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is not cut-off event [2021-08-12 23:34:58,782 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-08-12 23:34:58,782 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-08-12 23:34:58,782 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-08-12 23:34:59,451 INFO L129 PetriNetUnfolder]: 14390/31556 cut-off events. [2021-08-12 23:34:59,451 INFO L130 PetriNetUnfolder]: For 65074/74328 co-relation queries the response was YES. [2021-08-12 23:34:59,620 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124288 conditions, 31556 events. 14390/31556 cut-off events. For 65074/74328 co-relation queries the response was YES. Maximal size of possible extension queue 1373. Compared 350620 event pairs, 1050 based on Foata normal form. 939/30439 useless extension candidates. Maximal degree in co-relation 111988. Up to 8768 conditions per place. [2021-08-12 23:34:59,698 INFO L132 encePairwiseOnDemand]: 162/184 looper letters, 338 selfloop transitions, 162 changer transitions 39/837 dead transitions. [2021-08-12 23:34:59,699 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 837 transitions, 8456 flow [2021-08-12 23:34:59,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-12 23:34:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-08-12 23:34:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2737 transitions. [2021-08-12 23:34:59,703 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.7828947368421053 [2021-08-12 23:34:59,703 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2737 transitions. [2021-08-12 23:34:59,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2737 transitions. [2021-08-12 23:34:59,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 23:34:59,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2737 transitions. [2021-08-12 23:34:59,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 144.05263157894737) internal successors, (2737), 19 states have internal predecessors, (2737), 0 states have call successors, (0), 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-08-12 23:34:59,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 184.0) internal successors, (3680), 20 states have internal predecessors, (3680), 0 states have call successors, (0), 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-08-12 23:34:59,710 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 184.0) internal successors, (3680), 20 states have internal predecessors, (3680), 0 states have call successors, (0), 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-08-12 23:34:59,710 INFO L348 CegarLoopForPetriNet]: 156 programPoint places, 74 predicate places. [2021-08-12 23:34:59,710 INFO L482 AbstractCegarLoop]: Abstraction has has 230 places, 837 transitions, 8456 flow [2021-08-12 23:34:59,711 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 134.63636363636363) internal successors, (1481), 11 states have internal predecessors, (1481), 0 states have call successors, (0), 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-08-12 23:34:59,711 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 23:34:59,711 INFO L266 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] [2021-08-12 23:34:59,711 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-12 23:34:59,711 INFO L430 AbstractCegarLoop]: === Iteration 14 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 23:34:59,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 23:34:59,711 INFO L82 PathProgramCache]: Analyzing trace with hash 179524703, now seen corresponding path program 2 times [2021-08-12 23:34:59,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 23:34:59,711 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741424674] [2021-08-12 23:34:59,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 23:34:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 23:34:59,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:59,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:34:59,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:59,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:34:59,740 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-08-12 23:34:59,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:34:59,744 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-08-12 23:34:59,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:34:59,750 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-08-12 23:34:59,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:34:59,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:59,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:34:59,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:59,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:34:59,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:59,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:34:59,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:59,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:34:59,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:59,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 23:34:59,788 INFO L142 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-08-12 23:34:59,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:34:59,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:34:59,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:34:59,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 23:34:59,789 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 23:34:59,789 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741424674] [2021-08-12 23:34:59,789 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741424674] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 23:34:59,789 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 23:34:59,789 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-12 23:34:59,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699396243] [2021-08-12 23:34:59,790 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-12 23:34:59,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 23:34:59,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-12 23:34:59,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-12 23:34:59,791 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 184 [2021-08-12 23:34:59,792 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 837 transitions, 8456 flow. Second operand has 10 states, 10 states have (on average 134.8) internal successors, (1348), 10 states have internal predecessors, (1348), 0 states have call successors, (0), 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-08-12 23:34:59,792 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 23:34:59,792 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 184 [2021-08-12 23:34:59,792 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 23:35:04,169 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem22_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_#t~mem22=|v_qrcu_updaterThread1of1ForFork0_#t~mem22_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_5|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem22][746], [194#true, 259#(= ~idx~0 1), 229#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 261#true, 70#L777true, 169#true, 171#true, 173#true, 271#true, 176#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), 241#(= ~readerprogress1~0 2), 178#true, 338#true, 19#L739true, 51#L758-3true, 245#(= ~readerprogress2~0 2), 312#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 121#L787-1true, 185#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), 253#true, 221#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem22| 0))]) [2021-08-12 23:35:04,169 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is not cut-off event [2021-08-12 23:35:04,169 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-08-12 23:35:04,169 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-08-12 23:35:04,169 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-08-12 23:35:04,633 INFO L129 PetriNetUnfolder]: 13603/30072 cut-off events. [2021-08-12 23:35:04,633 INFO L130 PetriNetUnfolder]: For 77163/87386 co-relation queries the response was YES. [2021-08-12 23:35:04,815 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130586 conditions, 30072 events. 13603/30072 cut-off events. For 77163/87386 co-relation queries the response was YES. Maximal size of possible extension queue 1298. Compared 332410 event pairs, 930 based on Foata normal form. 1152/29286 useless extension candidates. Maximal degree in co-relation 126790. Up to 8392 conditions per place. [2021-08-12 23:35:05,057 INFO L132 encePairwiseOnDemand]: 167/184 looper letters, 391 selfloop transitions, 163 changer transitions 50/892 dead transitions. [2021-08-12 23:35:05,057 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 892 transitions, 10243 flow [2021-08-12 23:35:05,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-12 23:35:05,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-08-12 23:35:05,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2062 transitions. [2021-08-12 23:35:05,060 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8004658385093167 [2021-08-12 23:35:05,060 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2062 transitions. [2021-08-12 23:35:05,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2062 transitions. [2021-08-12 23:35:05,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 23:35:05,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2062 transitions. [2021-08-12 23:35:05,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 147.28571428571428) internal successors, (2062), 14 states have internal predecessors, (2062), 0 states have call successors, (0), 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-08-12 23:35:05,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 184.0) internal successors, (2760), 15 states have internal predecessors, (2760), 0 states have call successors, (0), 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-08-12 23:35:05,069 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 184.0) internal successors, (2760), 15 states have internal predecessors, (2760), 0 states have call successors, (0), 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-08-12 23:35:05,069 INFO L348 CegarLoopForPetriNet]: 156 programPoint places, 87 predicate places. [2021-08-12 23:35:05,070 INFO L482 AbstractCegarLoop]: Abstraction has has 243 places, 892 transitions, 10243 flow [2021-08-12 23:35:05,073 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 134.8) internal successors, (1348), 10 states have internal predecessors, (1348), 0 states have call successors, (0), 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-08-12 23:35:05,073 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 23:35:05,073 INFO L266 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] [2021-08-12 23:35:05,073 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-12 23:35:05,073 INFO L430 AbstractCegarLoop]: === Iteration 15 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 23:35:05,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 23:35:05,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1208863521, now seen corresponding path program 2 times [2021-08-12 23:35:05,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 23:35:05,074 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870611176] [2021-08-12 23:35:05,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 23:35:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 23:35:05,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:05,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:35:05,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:05,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:35:05,110 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-08-12 23:35:05,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:35:05,115 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-08-12 23:35:05,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:35:05,122 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-08-12 23:35:05,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:35:05,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:05,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:35:05,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:05,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:35:05,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:05,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:35:05,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:05,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:35:05,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:05,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:35:05,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:05,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:35:05,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 23:35:05,167 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 23:35:05,167 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870611176] [2021-08-12 23:35:05,167 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870611176] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 23:35:05,169 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 23:35:05,169 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-12 23:35:05,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416117563] [2021-08-12 23:35:05,170 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-12 23:35:05,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 23:35:05,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-12 23:35:05,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-08-12 23:35:05,173 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 184 [2021-08-12 23:35:05,173 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 892 transitions, 10243 flow. Second operand has 11 states, 11 states have (on average 134.63636363636363) internal successors, (1481), 11 states have internal predecessors, (1481), 0 states have call successors, (0), 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-08-12 23:35:05,173 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 23:35:05,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 184 [2021-08-12 23:35:05,174 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 23:35:09,866 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem22_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_#t~mem22=|v_qrcu_updaterThread1of1ForFork0_#t~mem22_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_5|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem22][754], [194#true, 259#(= ~idx~0 1), 261#true, 229#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 70#L777true, 169#true, 171#true, 173#true, 271#true, 176#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), 241#(= ~readerprogress1~0 2), 178#true, 338#true, 51#L758-3true, 19#L739true, 245#(= ~readerprogress2~0 2), 312#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 185#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), 377#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 121#L787-1true, 221#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem22| 0)), 253#true]) [2021-08-12 23:35:09,867 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is not cut-off event [2021-08-12 23:35:09,867 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-08-12 23:35:09,867 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-08-12 23:35:09,867 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-08-12 23:35:10,326 INFO L129 PetriNetUnfolder]: 13582/30401 cut-off events. [2021-08-12 23:35:10,326 INFO L130 PetriNetUnfolder]: For 96674/109814 co-relation queries the response was YES. [2021-08-12 23:35:10,571 INFO L84 FinitePrefix]: Finished finitePrefix Result has 143684 conditions, 30401 events. 13582/30401 cut-off events. For 96674/109814 co-relation queries the response was YES. Maximal size of possible extension queue 1331. Compared 339582 event pairs, 915 based on Foata normal form. 1209/29670 useless extension candidates. Maximal degree in co-relation 139650. Up to 8477 conditions per place. [2021-08-12 23:35:10,650 INFO L132 encePairwiseOnDemand]: 162/184 looper letters, 384 selfloop transitions, 181 changer transitions 51/904 dead transitions. [2021-08-12 23:35:10,651 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 904 transitions, 11549 flow [2021-08-12 23:35:10,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-12 23:35:10,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-08-12 23:35:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2749 transitions. [2021-08-12 23:35:10,671 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.7863272311212814 [2021-08-12 23:35:10,672 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2749 transitions. [2021-08-12 23:35:10,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2749 transitions. [2021-08-12 23:35:10,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 23:35:10,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2749 transitions. [2021-08-12 23:35:10,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 144.68421052631578) internal successors, (2749), 19 states have internal predecessors, (2749), 0 states have call successors, (0), 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-08-12 23:35:10,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 184.0) internal successors, (3680), 20 states have internal predecessors, (3680), 0 states have call successors, (0), 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-08-12 23:35:10,695 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 184.0) internal successors, (3680), 20 states have internal predecessors, (3680), 0 states have call successors, (0), 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-08-12 23:35:10,695 INFO L348 CegarLoopForPetriNet]: 156 programPoint places, 105 predicate places. [2021-08-12 23:35:10,695 INFO L482 AbstractCegarLoop]: Abstraction has has 261 places, 904 transitions, 11549 flow [2021-08-12 23:35:10,696 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 134.63636363636363) internal successors, (1481), 11 states have internal predecessors, (1481), 0 states have call successors, (0), 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-08-12 23:35:10,696 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 23:35:10,696 INFO L266 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] [2021-08-12 23:35:10,696 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-12 23:35:10,696 INFO L430 AbstractCegarLoop]: === Iteration 16 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 23:35:10,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 23:35:10,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1631492391, now seen corresponding path program 3 times [2021-08-12 23:35:10,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 23:35:10,696 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142981462] [2021-08-12 23:35:10,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 23:35:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 23:35:10,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:10,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:35:10,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:10,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:35:10,764 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-08-12 23:35:10,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:35:10,773 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-08-12 23:35:10,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:35:10,780 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-08-12 23:35:10,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:35:10,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:10,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:35:10,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:10,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:35:10,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:10,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:35:10,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:10,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:35:10,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:10,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:35:10,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:10,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:35:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 23:35:10,829 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 23:35:10,829 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142981462] [2021-08-12 23:35:10,831 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142981462] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 23:35:10,831 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 23:35:10,831 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-12 23:35:10,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543802693] [2021-08-12 23:35:10,831 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-12 23:35:10,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 23:35:10,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-12 23:35:10,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-08-12 23:35:10,833 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 184 [2021-08-12 23:35:10,834 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 904 transitions, 11549 flow. Second operand has 11 states, 11 states have (on average 134.63636363636363) internal successors, (1481), 11 states have internal predecessors, (1481), 0 states have call successors, (0), 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-08-12 23:35:10,834 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 23:35:10,834 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 184 [2021-08-12 23:35:10,834 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 23:35:15,560 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([823] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem22_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_#t~mem22=|v_qrcu_updaterThread1of1ForFork0_#t~mem22_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset_5|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem22][766], [194#true, 259#(= ~idx~0 1), 261#true, 229#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 70#L777true, 169#true, 171#true, 173#true, 271#true, 176#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), 241#(= ~readerprogress1~0 2), 178#true, 338#true, 19#L739true, 51#L758-3true, 245#(= ~readerprogress2~0 2), 312#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 185#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), 377#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 121#L787-1true, 221#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem22| 0)), 253#true, 415#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0)]) [2021-08-12 23:35:15,560 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is not cut-off event [2021-08-12 23:35:15,560 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-08-12 23:35:15,560 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-08-12 23:35:15,560 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-08-12 23:35:16,229 INFO L129 PetriNetUnfolder]: 13118/29823 cut-off events. [2021-08-12 23:35:16,230 INFO L130 PetriNetUnfolder]: For 117405/131935 co-relation queries the response was YES. [2021-08-12 23:35:16,387 INFO L84 FinitePrefix]: Finished finitePrefix Result has 153422 conditions, 29823 events. 13118/29823 cut-off events. For 117405/131935 co-relation queries the response was YES. Maximal size of possible extension queue 1339. Compared 335314 event pairs, 801 based on Foata normal form. 1404/29415 useless extension candidates. Maximal degree in co-relation 138523. Up to 8408 conditions per place. [2021-08-12 23:35:16,479 INFO L132 encePairwiseOnDemand]: 162/184 looper letters, 386 selfloop transitions, 196 changer transitions 43/920 dead transitions. [2021-08-12 23:35:16,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 920 transitions, 12975 flow [2021-08-12 23:35:16,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-12 23:35:16,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-08-12 23:35:16,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3023 transitions. [2021-08-12 23:35:16,481 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.7823498964803313 [2021-08-12 23:35:16,481 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3023 transitions. [2021-08-12 23:35:16,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3023 transitions. [2021-08-12 23:35:16,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 23:35:16,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3023 transitions. [2021-08-12 23:35:16,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 143.95238095238096) internal successors, (3023), 21 states have internal predecessors, (3023), 0 states have call successors, (0), 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-08-12 23:35:16,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 184.0) internal successors, (4048), 22 states have internal predecessors, (4048), 0 states have call successors, (0), 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-08-12 23:35:16,517 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 184.0) internal successors, (4048), 22 states have internal predecessors, (4048), 0 states have call successors, (0), 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-08-12 23:35:16,517 INFO L348 CegarLoopForPetriNet]: 156 programPoint places, 125 predicate places. [2021-08-12 23:35:16,517 INFO L482 AbstractCegarLoop]: Abstraction has has 281 places, 920 transitions, 12975 flow [2021-08-12 23:35:16,518 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 134.63636363636363) internal successors, (1481), 11 states have internal predecessors, (1481), 0 states have call successors, (0), 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-08-12 23:35:16,518 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 23:35:16,518 INFO L266 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] [2021-08-12 23:35:16,518 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-12 23:35:16,518 INFO L430 AbstractCegarLoop]: === Iteration 17 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 23:35:16,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 23:35:16,519 INFO L82 PathProgramCache]: Analyzing trace with hash -427811292, now seen corresponding path program 1 times [2021-08-12 23:35:16,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 23:35:16,519 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142239094] [2021-08-12 23:35:16,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 23:35:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 23:35:16,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:16,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:35:16,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:16,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:35:16,580 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-08-12 23:35:16,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:35:16,584 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-08-12 23:35:16,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:35:16,590 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-08-12 23:35:16,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:35:16,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:16,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:35:16,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:16,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:35:16,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:16,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:35:16,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:16,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:35:16,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:16,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 23:35:16,633 INFO L142 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-08-12 23:35:16,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:35:16,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:16,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:35:16,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 23:35:16,634 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 23:35:16,634 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142239094] [2021-08-12 23:35:16,634 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142239094] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 23:35:16,634 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 23:35:16,634 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-12 23:35:16,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610893462] [2021-08-12 23:35:16,635 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-12 23:35:16,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 23:35:16,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-12 23:35:16,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-12 23:35:16,636 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 184 [2021-08-12 23:35:16,637 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 920 transitions, 12975 flow. Second operand has 10 states, 10 states have (on average 134.8) internal successors, (1348), 10 states have internal predecessors, (1348), 0 states have call successors, (0), 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-08-12 23:35:16,637 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 23:35:16,637 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 184 [2021-08-12 23:35:16,637 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 23:35:18,382 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([623] L788-->L788-1: Formula: (= |v_ULTIMATE.start_main_#t~mem31_2| (select (select |v_#memory_int_19| |v_ULTIMATE.start_main_~#t2~0.base_4|) |v_ULTIMATE.start_main_~#t2~0.offset_4|)) InVars {ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|} OutVars{ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|, ULTIMATE.start_main_#t~mem31=|v_ULTIMATE.start_main_#t~mem31_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem31][439], [96#L763-1true, 257#true, 194#true, 261#true, 169#true, 171#true, 172#true, 205#true, 462#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 174#true, 304#(= ~idx~0 0), 241#(= ~readerprogress1~0 2), 273#(= ~idx~0 0), 369#(= ~idx~0 0), 178#true, 340#(= ~idx~0 0), 53#L788-1true, 245#(= ~readerprogress2~0 2), 182#true, 407#(= ~idx~0 0), 58#L758true, 255#(= ~idx~0 0), 223#true]) [2021-08-12 23:35:18,383 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2021-08-12 23:35:18,383 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:35:18,383 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:35:18,383 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:35:22,607 INFO L129 PetriNetUnfolder]: 14237/32957 cut-off events. [2021-08-12 23:35:22,607 INFO L130 PetriNetUnfolder]: For 154135/169764 co-relation queries the response was YES. [2021-08-12 23:35:22,834 INFO L84 FinitePrefix]: Finished finitePrefix Result has 178221 conditions, 32957 events. 14237/32957 cut-off events. For 154135/169764 co-relation queries the response was YES. Maximal size of possible extension queue 1443. Compared 378352 event pairs, 713 based on Foata normal form. 1197/32130 useless extension candidates. Maximal degree in co-relation 173474. Up to 8853 conditions per place. [2021-08-12 23:35:23,100 INFO L132 encePairwiseOnDemand]: 167/184 looper letters, 556 selfloop transitions, 162 changer transitions 59/1072 dead transitions. [2021-08-12 23:35:23,100 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 1072 transitions, 17123 flow [2021-08-12 23:35:23,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-12 23:35:23,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-08-12 23:35:23,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2062 transitions. [2021-08-12 23:35:23,102 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8004658385093167 [2021-08-12 23:35:23,102 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2062 transitions. [2021-08-12 23:35:23,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2062 transitions. [2021-08-12 23:35:23,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 23:35:23,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2062 transitions. [2021-08-12 23:35:23,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 147.28571428571428) internal successors, (2062), 14 states have internal predecessors, (2062), 0 states have call successors, (0), 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-08-12 23:35:23,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 184.0) internal successors, (2760), 15 states have internal predecessors, (2760), 0 states have call successors, (0), 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-08-12 23:35:23,106 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 184.0) internal successors, (2760), 15 states have internal predecessors, (2760), 0 states have call successors, (0), 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-08-12 23:35:23,106 INFO L348 CegarLoopForPetriNet]: 156 programPoint places, 138 predicate places. [2021-08-12 23:35:23,106 INFO L482 AbstractCegarLoop]: Abstraction has has 294 places, 1072 transitions, 17123 flow [2021-08-12 23:35:23,106 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 134.8) internal successors, (1348), 10 states have internal predecessors, (1348), 0 states have call successors, (0), 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-08-12 23:35:23,106 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 23:35:23,106 INFO L266 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] [2021-08-12 23:35:23,106 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-12 23:35:23,106 INFO L430 AbstractCegarLoop]: === Iteration 18 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 23:35:23,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 23:35:23,107 INFO L82 PathProgramCache]: Analyzing trace with hash 476825672, now seen corresponding path program 1 times [2021-08-12 23:35:23,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 23:35:23,107 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505768822] [2021-08-12 23:35:23,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 23:35:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 23:35:23,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:23,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:35:23,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:23,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:35:23,133 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-08-12 23:35:23,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:35:23,137 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-08-12 23:35:23,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:35:23,142 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-08-12 23:35:23,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:35:23,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:23,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:35:23,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:23,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:35:23,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:23,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:35:23,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:23,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:35:23,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:23,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:35:23,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:23,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:35:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 23:35:23,185 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 23:35:23,185 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505768822] [2021-08-12 23:35:23,185 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505768822] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 23:35:23,185 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 23:35:23,185 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-12 23:35:23,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697500918] [2021-08-12 23:35:23,186 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-12 23:35:23,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 23:35:23,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-12 23:35:23,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-08-12 23:35:23,187 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 184 [2021-08-12 23:35:23,187 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 1072 transitions, 17123 flow. Second operand has 11 states, 11 states have (on average 134.63636363636363) internal successors, (1481), 11 states have internal predecessors, (1481), 0 states have call successors, (0), 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-08-12 23:35:23,187 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 23:35:23,187 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 184 [2021-08-12 23:35:23,187 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 23:35:25,085 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([623] L788-->L788-1: Formula: (= |v_ULTIMATE.start_main_#t~mem31_2| (select (select |v_#memory_int_19| |v_ULTIMATE.start_main_~#t2~0.base_4|) |v_ULTIMATE.start_main_~#t2~0.offset_4|)) InVars {ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|} OutVars{ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|, ULTIMATE.start_main_#t~mem31=|v_ULTIMATE.start_main_#t~mem31_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem31][442], [96#L763-1true, 257#true, 194#true, 261#true, 169#true, 171#true, 492#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 172#true, 205#true, 462#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 174#true, 304#(= ~idx~0 0), 241#(= ~readerprogress1~0 2), 273#(= ~idx~0 0), 369#(= ~idx~0 0), 178#true, 340#(= ~idx~0 0), 53#L788-1true, 245#(= ~readerprogress2~0 2), 182#true, 407#(= ~idx~0 0), 58#L758true, 223#true, 255#(= ~idx~0 0)]) [2021-08-12 23:35:25,085 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2021-08-12 23:35:25,085 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:35:25,085 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:35:25,085 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:35:29,594 INFO L129 PetriNetUnfolder]: 14152/32766 cut-off events. [2021-08-12 23:35:29,595 INFO L130 PetriNetUnfolder]: For 180026/198851 co-relation queries the response was YES. [2021-08-12 23:35:29,823 INFO L84 FinitePrefix]: Finished finitePrefix Result has 191079 conditions, 32766 events. 14152/32766 cut-off events. For 180026/198851 co-relation queries the response was YES. Maximal size of possible extension queue 1450. Compared 376078 event pairs, 715 based on Foata normal form. 1328/32142 useless extension candidates. Maximal degree in co-relation 186073. Up to 8847 conditions per place. [2021-08-12 23:35:30,043 INFO L132 encePairwiseOnDemand]: 162/184 looper letters, 507 selfloop transitions, 224 changer transitions 59/1085 dead transitions. [2021-08-12 23:35:30,044 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 1085 transitions, 18813 flow [2021-08-12 23:35:30,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-12 23:35:30,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-08-12 23:35:30,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2746 transitions. [2021-08-12 23:35:30,046 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.7854691075514875 [2021-08-12 23:35:30,046 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2746 transitions. [2021-08-12 23:35:30,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2746 transitions. [2021-08-12 23:35:30,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 23:35:30,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2746 transitions. [2021-08-12 23:35:30,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 144.52631578947367) internal successors, (2746), 19 states have internal predecessors, (2746), 0 states have call successors, (0), 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-08-12 23:35:30,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 184.0) internal successors, (3680), 20 states have internal predecessors, (3680), 0 states have call successors, (0), 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-08-12 23:35:30,051 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 184.0) internal successors, (3680), 20 states have internal predecessors, (3680), 0 states have call successors, (0), 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-08-12 23:35:30,051 INFO L348 CegarLoopForPetriNet]: 156 programPoint places, 156 predicate places. [2021-08-12 23:35:30,052 INFO L482 AbstractCegarLoop]: Abstraction has has 312 places, 1085 transitions, 18813 flow [2021-08-12 23:35:30,052 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 134.63636363636363) internal successors, (1481), 11 states have internal predecessors, (1481), 0 states have call successors, (0), 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-08-12 23:35:30,052 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 23:35:30,052 INFO L266 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] [2021-08-12 23:35:30,052 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-12 23:35:30,052 INFO L430 AbstractCegarLoop]: === Iteration 19 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 23:35:30,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 23:35:30,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1176296428, now seen corresponding path program 2 times [2021-08-12 23:35:30,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 23:35:30,053 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405652045] [2021-08-12 23:35:30,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 23:35:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 23:35:30,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:30,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:35:30,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:30,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:35:30,084 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-08-12 23:35:30,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:35:30,089 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-08-12 23:35:30,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:35:30,095 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-08-12 23:35:30,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:35:30,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:30,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:35:30,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:30,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:35:30,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:30,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:35:30,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:30,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:35:30,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:30,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 23:35:30,137 INFO L142 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-08-12 23:35:30,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:35:30,139 INFO L142 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-08-12 23:35:30,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:35:30,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:30,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:35:30,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 23:35:30,140 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 23:35:30,140 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405652045] [2021-08-12 23:35:30,140 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405652045] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 23:35:30,140 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 23:35:30,140 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-12 23:35:30,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009662094] [2021-08-12 23:35:30,141 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-12 23:35:30,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 23:35:30,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-12 23:35:30,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-08-12 23:35:30,142 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 184 [2021-08-12 23:35:30,143 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 1085 transitions, 18813 flow. Second operand has 10 states, 10 states have (on average 134.8) internal successors, (1348), 10 states have internal predecessors, (1348), 0 states have call successors, (0), 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-08-12 23:35:30,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 23:35:30,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 184 [2021-08-12 23:35:30,143 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 23:35:31,967 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([623] L788-->L788-1: Formula: (= |v_ULTIMATE.start_main_#t~mem31_2| (select (select |v_#memory_int_19| |v_ULTIMATE.start_main_~#t2~0.base_4|) |v_ULTIMATE.start_main_~#t2~0.offset_4|)) InVars {ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|} OutVars{ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|, ULTIMATE.start_main_#t~mem31=|v_ULTIMATE.start_main_#t~mem31_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem31][444], [257#true, 194#true, 261#true, 205#true, 462#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 527#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), 273#(= ~idx~0 0), 340#(= ~idx~0 0), 407#(= ~idx~0 0), 223#true, 96#L763-1true, 169#true, 171#true, 492#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 172#true, 174#true, 304#(= ~idx~0 0), 369#(= ~idx~0 0), 241#(= ~readerprogress1~0 2), 178#true, 53#L788-1true, 245#(= ~readerprogress2~0 2), 182#true, 58#L758true, 255#(= ~idx~0 0)]) [2021-08-12 23:35:31,967 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2021-08-12 23:35:31,967 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:35:31,967 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:35:31,967 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:35:36,754 INFO L129 PetriNetUnfolder]: 14357/33117 cut-off events. [2021-08-12 23:35:36,754 INFO L130 PetriNetUnfolder]: For 217098/237953 co-relation queries the response was YES. [2021-08-12 23:35:37,156 INFO L84 FinitePrefix]: Finished finitePrefix Result has 207925 conditions, 33117 events. 14357/33117 cut-off events. For 217098/237953 co-relation queries the response was YES. Maximal size of possible extension queue 1470. Compared 379721 event pairs, 721 based on Foata normal form. 1216/32375 useless extension candidates. Maximal degree in co-relation 190205. Up to 9057 conditions per place. [2021-08-12 23:35:37,289 INFO L132 encePairwiseOnDemand]: 168/184 looper letters, 609 selfloop transitions, 169 changer transitions 49/1131 dead transitions. [2021-08-12 23:35:37,289 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 1131 transitions, 21408 flow [2021-08-12 23:35:37,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-12 23:35:37,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-08-12 23:35:37,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2198 transitions. [2021-08-12 23:35:37,291 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.7963768115942029 [2021-08-12 23:35:37,292 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2198 transitions. [2021-08-12 23:35:37,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2198 transitions. [2021-08-12 23:35:37,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 23:35:37,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2198 transitions. [2021-08-12 23:35:37,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 146.53333333333333) internal successors, (2198), 15 states have internal predecessors, (2198), 0 states have call successors, (0), 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-08-12 23:35:37,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 184.0) internal successors, (2944), 16 states have internal predecessors, (2944), 0 states have call successors, (0), 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-08-12 23:35:37,296 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 184.0) internal successors, (2944), 16 states have internal predecessors, (2944), 0 states have call successors, (0), 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-08-12 23:35:37,296 INFO L348 CegarLoopForPetriNet]: 156 programPoint places, 170 predicate places. [2021-08-12 23:35:37,296 INFO L482 AbstractCegarLoop]: Abstraction has has 326 places, 1131 transitions, 21408 flow [2021-08-12 23:35:37,296 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 134.8) internal successors, (1348), 10 states have internal predecessors, (1348), 0 states have call successors, (0), 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-08-12 23:35:37,296 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 23:35:37,296 INFO L266 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] [2021-08-12 23:35:37,296 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-12 23:35:37,296 INFO L430 AbstractCegarLoop]: === Iteration 20 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 23:35:37,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 23:35:37,297 INFO L82 PathProgramCache]: Analyzing trace with hash -353921174, now seen corresponding path program 2 times [2021-08-12 23:35:37,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 23:35:37,297 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651476832] [2021-08-12 23:35:37,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 23:35:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 23:35:37,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:37,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:35:37,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:37,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:35:37,326 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-08-12 23:35:37,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:35:37,330 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-08-12 23:35:37,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:35:37,336 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-08-12 23:35:37,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:35:37,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:37,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:35:37,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:37,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 23:35:37,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:37,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:35:37,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:37,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:35:37,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:37,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:35:37,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:37,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:35:37,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 23:35:37,377 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 23:35:37,377 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651476832] [2021-08-12 23:35:37,377 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651476832] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 23:35:37,378 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 23:35:37,378 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-12 23:35:37,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554558364] [2021-08-12 23:35:37,378 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-12 23:35:37,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 23:35:37,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-12 23:35:37,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-08-12 23:35:37,379 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 184 [2021-08-12 23:35:37,380 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 1131 transitions, 21408 flow. Second operand has 11 states, 11 states have (on average 134.63636363636363) internal successors, (1481), 11 states have internal predecessors, (1481), 0 states have call successors, (0), 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-08-12 23:35:37,380 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 23:35:37,380 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 184 [2021-08-12 23:35:37,380 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 23:35:39,539 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([623] L788-->L788-1: Formula: (= |v_ULTIMATE.start_main_#t~mem31_2| (select (select |v_#memory_int_19| |v_ULTIMATE.start_main_~#t2~0.base_4|) |v_ULTIMATE.start_main_~#t2~0.offset_4|)) InVars {ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|} OutVars{ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|, ULTIMATE.start_main_#t~mem31=|v_ULTIMATE.start_main_#t~mem31_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem31][444], [257#true, 194#true, 261#true, 205#true, 462#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 527#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), 273#(= ~idx~0 0), 340#(= ~idx~0 0), 407#(= ~idx~0 0), 223#true, 96#L763-1true, 169#true, 171#true, 492#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 172#true, 174#true, 559#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), 304#(= ~idx~0 0), 241#(= ~readerprogress1~0 2), 369#(= ~idx~0 0), 178#true, 53#L788-1true, 245#(= ~readerprogress2~0 2), 182#true, 58#L758true, 255#(= ~idx~0 0)]) [2021-08-12 23:35:39,539 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2021-08-12 23:35:39,539 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:35:39,539 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:35:39,539 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:35:44,806 INFO L129 PetriNetUnfolder]: 14194/32906 cut-off events. [2021-08-12 23:35:44,807 INFO L130 PetriNetUnfolder]: For 252169/275521 co-relation queries the response was YES. [2021-08-12 23:35:45,042 INFO L84 FinitePrefix]: Finished finitePrefix Result has 221438 conditions, 32906 events. 14194/32906 cut-off events. For 252169/275521 co-relation queries the response was YES. Maximal size of possible extension queue 1525. Compared 378553 event pairs, 722 based on Foata normal form. 1444/32515 useless extension candidates. Maximal degree in co-relation 203849. Up to 9121 conditions per place. [2021-08-12 23:35:45,244 INFO L132 encePairwiseOnDemand]: 162/184 looper letters, 559 selfloop transitions, 252 changer transitions 10/1159 dead transitions. [2021-08-12 23:35:45,244 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 1159 transitions, 23706 flow [2021-08-12 23:35:45,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-12 23:35:45,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-08-12 23:35:45,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3020 transitions. [2021-08-12 23:35:45,246 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.7815734989648033 [2021-08-12 23:35:45,246 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3020 transitions. [2021-08-12 23:35:45,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3020 transitions. [2021-08-12 23:35:45,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 23:35:45,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3020 transitions. [2021-08-12 23:35:45,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 143.8095238095238) internal successors, (3020), 21 states have internal predecessors, (3020), 0 states have call successors, (0), 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-08-12 23:35:45,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 184.0) internal successors, (4048), 22 states have internal predecessors, (4048), 0 states have call successors, (0), 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-08-12 23:35:45,251 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 184.0) internal successors, (4048), 22 states have internal predecessors, (4048), 0 states have call successors, (0), 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-08-12 23:35:45,251 INFO L348 CegarLoopForPetriNet]: 156 programPoint places, 190 predicate places. [2021-08-12 23:35:45,251 INFO L482 AbstractCegarLoop]: Abstraction has has 346 places, 1159 transitions, 23706 flow [2021-08-12 23:35:45,251 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 134.63636363636363) internal successors, (1481), 11 states have internal predecessors, (1481), 0 states have call successors, (0), 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-08-12 23:35:45,251 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 23:35:45,252 INFO L266 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] [2021-08-12 23:35:45,252 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-12 23:35:45,252 INFO L430 AbstractCegarLoop]: === Iteration 21 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 23:35:45,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 23:35:45,252 INFO L82 PathProgramCache]: Analyzing trace with hash 35639310, now seen corresponding path program 1 times [2021-08-12 23:35:45,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 23:35:45,252 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330885117] [2021-08-12 23:35:45,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 23:35:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 23:35:45,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:45,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:35:45,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:45,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:35:45,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:45,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:35:45,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:45,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:35:45,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:45,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:35:45,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:45,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:35:45,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:45,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:35:45,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:45,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:35:45,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 23:35:45,303 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 23:35:45,303 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330885117] [2021-08-12 23:35:45,303 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330885117] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 23:35:45,304 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 23:35:45,304 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-12 23:35:45,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283854698] [2021-08-12 23:35:45,304 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-12 23:35:45,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 23:35:45,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-12 23:35:45,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-12 23:35:45,305 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 184 [2021-08-12 23:35:45,305 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 1159 transitions, 23706 flow. Second operand has 8 states, 8 states have (on average 151.125) internal successors, (1209), 8 states have internal predecessors, (1209), 0 states have call successors, (0), 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-08-12 23:35:45,305 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 23:35:45,305 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 184 [2021-08-12 23:35:45,305 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 23:35:47,302 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([623] L788-->L788-1: Formula: (= |v_ULTIMATE.start_main_#t~mem31_2| (select (select |v_#memory_int_19| |v_ULTIMATE.start_main_~#t2~0.base_4|) |v_ULTIMATE.start_main_~#t2~0.offset_4|)) InVars {ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|} OutVars{ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|, ULTIMATE.start_main_#t~mem31=|v_ULTIMATE.start_main_#t~mem31_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem31][453], [257#true, 194#true, 261#true, 589#(= ~idx~0 0), 205#true, 462#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 527#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), 273#(= ~idx~0 0), 340#(= ~idx~0 0), 407#(= ~idx~0 0), 223#true, 96#L763-1true, 169#true, 171#true, 492#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 172#true, 174#true, 559#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), 304#(= ~idx~0 0), 369#(= ~idx~0 0), 241#(= ~readerprogress1~0 2), 178#true, 53#L788-1true, 245#(= ~readerprogress2~0 2), 182#true, 58#L758true, 255#(= ~idx~0 0)]) [2021-08-12 23:35:47,302 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2021-08-12 23:35:47,302 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:35:47,302 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:35:47,302 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:35:53,138 INFO L129 PetriNetUnfolder]: 14634/34746 cut-off events. [2021-08-12 23:35:53,138 INFO L130 PetriNetUnfolder]: For 314582/338563 co-relation queries the response was YES. [2021-08-12 23:35:53,406 INFO L84 FinitePrefix]: Finished finitePrefix Result has 241977 conditions, 34746 events. 14634/34746 cut-off events. For 314582/338563 co-relation queries the response was YES. Maximal size of possible extension queue 1589. Compared 408252 event pairs, 809 based on Foata normal form. 807/33641 useless extension candidates. Maximal degree in co-relation 236288. Up to 9480 conditions per place. [2021-08-12 23:35:53,551 INFO L132 encePairwiseOnDemand]: 171/184 looper letters, 383 selfloop transitions, 143 changer transitions 26/1220 dead transitions. [2021-08-12 23:35:53,552 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 1220 transitions, 26104 flow [2021-08-12 23:35:53,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-12 23:35:53,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-08-12 23:35:53,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1746 transitions. [2021-08-12 23:35:53,566 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8626482213438735 [2021-08-12 23:35:53,566 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1746 transitions. [2021-08-12 23:35:53,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1746 transitions. [2021-08-12 23:35:53,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 23:35:53,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1746 transitions. [2021-08-12 23:35:53,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 158.72727272727272) internal successors, (1746), 11 states have internal predecessors, (1746), 0 states have call successors, (0), 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-08-12 23:35:53,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 184.0) internal successors, (2208), 12 states have internal predecessors, (2208), 0 states have call successors, (0), 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-08-12 23:35:53,569 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 184.0) internal successors, (2208), 12 states have internal predecessors, (2208), 0 states have call successors, (0), 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-08-12 23:35:53,569 INFO L348 CegarLoopForPetriNet]: 156 programPoint places, 200 predicate places. [2021-08-12 23:35:53,569 INFO L482 AbstractCegarLoop]: Abstraction has has 356 places, 1220 transitions, 26104 flow [2021-08-12 23:35:53,569 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 151.125) internal successors, (1209), 8 states have internal predecessors, (1209), 0 states have call successors, (0), 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-08-12 23:35:53,570 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 23:35:53,570 INFO L266 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] [2021-08-12 23:35:53,570 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-12 23:35:53,570 INFO L430 AbstractCegarLoop]: === Iteration 22 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 23:35:53,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 23:35:53,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1251437910, now seen corresponding path program 2 times [2021-08-12 23:35:53,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 23:35:53,570 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829486818] [2021-08-12 23:35:53,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 23:35:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 23:35:53,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:53,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:35:53,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:53,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:35:53,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:53,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:35:53,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:53,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:35:53,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:53,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:35:53,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:53,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:35:53,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:53,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:35:53,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:35:53,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:35:53,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 23:35:53,645 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 23:35:53,645 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829486818] [2021-08-12 23:35:53,645 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829486818] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 23:35:53,645 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 23:35:53,645 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-12 23:35:53,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115504405] [2021-08-12 23:35:53,646 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-12 23:35:53,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 23:35:53,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-12 23:35:53,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-08-12 23:35:53,646 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 184 [2021-08-12 23:35:53,648 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 1220 transitions, 26104 flow. Second operand has 8 states, 8 states have (on average 151.125) internal successors, (1209), 8 states have internal predecessors, (1209), 0 states have call successors, (0), 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-08-12 23:35:53,648 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 23:35:53,648 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 184 [2021-08-12 23:35:53,648 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 23:35:55,826 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([623] L788-->L788-1: Formula: (= |v_ULTIMATE.start_main_#t~mem31_2| (select (select |v_#memory_int_19| |v_ULTIMATE.start_main_~#t2~0.base_4|) |v_ULTIMATE.start_main_~#t2~0.offset_4|)) InVars {ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|} OutVars{ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|, ULTIMATE.start_main_#t~mem31=|v_ULTIMATE.start_main_#t~mem31_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem31][455], [257#true, 194#true, 261#true, 589#(= ~idx~0 0), 205#true, 462#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 527#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), 273#(= ~idx~0 0), 340#(= ~idx~0 0), 407#(= ~idx~0 0), 223#true, 96#L763-1true, 610#(= ~idx~0 0), 169#true, 171#true, 492#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 172#true, 174#true, 559#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), 304#(= ~idx~0 0), 241#(= ~readerprogress1~0 2), 369#(= ~idx~0 0), 178#true, 53#L788-1true, 245#(= ~readerprogress2~0 2), 182#true, 58#L758true, 255#(= ~idx~0 0)]) [2021-08-12 23:35:55,826 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2021-08-12 23:35:55,826 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:35:55,826 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:35:55,826 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:36:01,459 INFO L129 PetriNetUnfolder]: 15422/36537 cut-off events. [2021-08-12 23:36:01,459 INFO L130 PetriNetUnfolder]: For 424581/455280 co-relation queries the response was YES. [2021-08-12 23:36:01,720 INFO L84 FinitePrefix]: Finished finitePrefix Result has 275307 conditions, 36537 events. 15422/36537 cut-off events. For 424581/455280 co-relation queries the response was YES. Maximal size of possible extension queue 1848. Compared 433808 event pairs, 771 based on Foata normal form. 976/35412 useless extension candidates. Maximal degree in co-relation 254961. Up to 10627 conditions per place. [2021-08-12 23:36:01,957 INFO L132 encePairwiseOnDemand]: 171/184 looper letters, 470 selfloop transitions, 192 changer transitions 11/1356 dead transitions. [2021-08-12 23:36:01,958 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 1356 transitions, 30950 flow [2021-08-12 23:36:01,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-12 23:36:01,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-08-12 23:36:01,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1905 transitions. [2021-08-12 23:36:01,960 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8627717391304348 [2021-08-12 23:36:01,960 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1905 transitions. [2021-08-12 23:36:01,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1905 transitions. [2021-08-12 23:36:01,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 23:36:01,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1905 transitions. [2021-08-12 23:36:01,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 158.75) internal successors, (1905), 12 states have internal predecessors, (1905), 0 states have call successors, (0), 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-08-12 23:36:01,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 184.0) internal successors, (2392), 13 states have internal predecessors, (2392), 0 states have call successors, (0), 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-08-12 23:36:01,964 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 184.0) internal successors, (2392), 13 states have internal predecessors, (2392), 0 states have call successors, (0), 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-08-12 23:36:01,964 INFO L348 CegarLoopForPetriNet]: 156 programPoint places, 211 predicate places. [2021-08-12 23:36:01,964 INFO L482 AbstractCegarLoop]: Abstraction has has 367 places, 1356 transitions, 30950 flow [2021-08-12 23:36:01,965 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 151.125) internal successors, (1209), 8 states have internal predecessors, (1209), 0 states have call successors, (0), 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-08-12 23:36:01,965 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 23:36:01,965 INFO L266 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] [2021-08-12 23:36:01,965 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-12 23:36:01,965 INFO L430 AbstractCegarLoop]: === Iteration 23 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 23:36:01,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 23:36:01,965 INFO L82 PathProgramCache]: Analyzing trace with hash 2071402322, now seen corresponding path program 3 times [2021-08-12 23:36:01,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 23:36:01,965 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926245903] [2021-08-12 23:36:01,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 23:36:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 23:36:02,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:02,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:36:02,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:02,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:36:02,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:02,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:36:02,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:02,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:36:02,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 23:36:02,044 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 23:36:02,044 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926245903] [2021-08-12 23:36:02,044 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926245903] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 23:36:02,044 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 23:36:02,044 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-12 23:36:02,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773757629] [2021-08-12 23:36:02,045 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-08-12 23:36:02,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 23:36:02,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-12 23:36:02,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-12 23:36:02,047 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 184 [2021-08-12 23:36:02,047 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 1356 transitions, 30950 flow. Second operand has 4 states, 4 states have (on average 166.5) internal successors, (666), 4 states have internal predecessors, (666), 0 states have call successors, (0), 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-08-12 23:36:02,047 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 23:36:02,047 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 184 [2021-08-12 23:36:02,047 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 23:36:03,719 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([623] L788-->L788-1: Formula: (= |v_ULTIMATE.start_main_#t~mem31_2| (select (select |v_#memory_int_19| |v_ULTIMATE.start_main_~#t2~0.base_4|) |v_ULTIMATE.start_main_~#t2~0.offset_4|)) InVars {ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|} OutVars{ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|, ULTIMATE.start_main_#t~mem31=|v_ULTIMATE.start_main_#t~mem31_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem31][455], [257#true, 194#true, 261#true, 205#true, 589#(= ~idx~0 0), 462#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 527#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), 273#(= ~idx~0 0), 340#(= ~idx~0 0), 407#(= ~idx~0 0), 223#true, 96#L763-1true, 610#(= ~idx~0 0), 169#true, 171#true, 172#true, 492#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 174#true, 559#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), 304#(= ~idx~0 0), 241#(= ~readerprogress1~0 2), 369#(= ~idx~0 0), 178#true, 629#true, 53#L788-1true, 245#(= ~readerprogress2~0 2), 182#true, 58#L758true, 255#(= ~idx~0 0)]) [2021-08-12 23:36:03,720 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2021-08-12 23:36:03,720 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:36:03,720 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:36:03,721 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:36:10,834 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([581] L789-->L789-1: Formula: (= |v_ULTIMATE.start_main_#t~mem32_2| (select (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t3~0.base_4|) |v_ULTIMATE.start_main_~#t3~0.offset_4|)) InVars {#memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~#t3~0.base=|v_ULTIMATE.start_main_~#t3~0.base_4|, ULTIMATE.start_main_~#t3~0.offset=|v_ULTIMATE.start_main_~#t3~0.offset_4|} OutVars{#memory_int=|v_#memory_int_20|, ULTIMATE.start_main_#t~mem32=|v_ULTIMATE.start_main_#t~mem32_2|, ULTIMATE.start_main_~#t3~0.base=|v_ULTIMATE.start_main_~#t3~0.base_4|, ULTIMATE.start_main_~#t3~0.offset=|v_ULTIMATE.start_main_~#t3~0.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem32][1297], [514#true, 194#true, 259#(= ~idx~0 1), 261#true, 587#true, 205#true, 271#true, 338#true, 21#L778true, 150#L789-1true, 415#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 608#true, 229#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 486#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 168#true, 555#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 171#true, 172#true, 176#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), 241#(= ~readerprogress1~0 2), 178#true, 245#(= ~readerprogress2~0 2), 312#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 377#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 185#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), 634#(and (= qrcu_reader2Thread1of1ForFork2_~myidx~1 1) (= ~idx~0 1)), 253#true, 447#true]) [2021-08-12 23:36:10,835 INFO L384 tUnfolder$Statistics]: this new event has 107 ancestors and is cut-off event [2021-08-12 23:36:10,835 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2021-08-12 23:36:10,835 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2021-08-12 23:36:10,835 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2021-08-12 23:36:10,885 INFO L129 PetriNetUnfolder]: 16904/40733 cut-off events. [2021-08-12 23:36:10,886 INFO L130 PetriNetUnfolder]: For 536479/570394 co-relation queries the response was YES. [2021-08-12 23:36:11,225 INFO L84 FinitePrefix]: Finished finitePrefix Result has 302817 conditions, 40733 events. 16904/40733 cut-off events. For 536479/570394 co-relation queries the response was YES. Maximal size of possible extension queue 1941. Compared 493135 event pairs, 931 based on Foata normal form. 522/38795 useless extension candidates. Maximal degree in co-relation 296496. Up to 11247 conditions per place. [2021-08-12 23:36:11,506 INFO L132 encePairwiseOnDemand]: 181/184 looper letters, 297 selfloop transitions, 12 changer transitions 41/1373 dead transitions. [2021-08-12 23:36:11,506 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 1373 transitions, 32062 flow [2021-08-12 23:36:11,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-12 23:36:11,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-08-12 23:36:11,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 679 transitions. [2021-08-12 23:36:11,507 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9225543478260869 [2021-08-12 23:36:11,507 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 679 transitions. [2021-08-12 23:36:11,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 679 transitions. [2021-08-12 23:36:11,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 23:36:11,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 679 transitions. [2021-08-12 23:36:11,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 169.75) internal successors, (679), 4 states have internal predecessors, (679), 0 states have call successors, (0), 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-08-12 23:36:11,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 184.0) internal successors, (920), 5 states have internal predecessors, (920), 0 states have call successors, (0), 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-08-12 23:36:11,508 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 184.0) internal successors, (920), 5 states have internal predecessors, (920), 0 states have call successors, (0), 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-08-12 23:36:11,508 INFO L348 CegarLoopForPetriNet]: 156 programPoint places, 214 predicate places. [2021-08-12 23:36:11,508 INFO L482 AbstractCegarLoop]: Abstraction has has 370 places, 1373 transitions, 32062 flow [2021-08-12 23:36:11,509 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 166.5) internal successors, (666), 4 states have internal predecessors, (666), 0 states have call successors, (0), 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-08-12 23:36:11,509 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 23:36:11,509 INFO L266 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] [2021-08-12 23:36:11,509 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-12 23:36:11,509 INFO L430 AbstractCegarLoop]: === Iteration 24 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 23:36:11,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 23:36:11,509 INFO L82 PathProgramCache]: Analyzing trace with hash -2022956564, now seen corresponding path program 4 times [2021-08-12 23:36:11,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 23:36:11,509 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346547350] [2021-08-12 23:36:11,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 23:36:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 23:36:11,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:11,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:36:11,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:11,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:36:11,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:11,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:36:11,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:11,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:36:11,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:11,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:36:11,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:11,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:36:11,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:11,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:36:11,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:11,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:36:11,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 23:36:11,569 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 23:36:11,569 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346547350] [2021-08-12 23:36:11,569 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346547350] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 23:36:11,569 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 23:36:11,569 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-12 23:36:11,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740618206] [2021-08-12 23:36:11,569 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-12 23:36:11,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 23:36:11,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-12 23:36:11,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-08-12 23:36:11,570 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 184 [2021-08-12 23:36:11,571 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 1373 transitions, 32062 flow. Second operand has 8 states, 8 states have (on average 151.125) internal successors, (1209), 8 states have internal predecessors, (1209), 0 states have call successors, (0), 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-08-12 23:36:11,571 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 23:36:11,571 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 184 [2021-08-12 23:36:11,571 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 23:36:13,809 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([623] L788-->L788-1: Formula: (= |v_ULTIMATE.start_main_#t~mem31_2| (select (select |v_#memory_int_19| |v_ULTIMATE.start_main_~#t2~0.base_4|) |v_ULTIMATE.start_main_~#t2~0.offset_4|)) InVars {ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|} OutVars{ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|, ULTIMATE.start_main_#t~mem31=|v_ULTIMATE.start_main_#t~mem31_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem31][456], [257#true, 194#true, 261#true, 205#true, 589#(= ~idx~0 0), 462#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 527#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), 273#(= ~idx~0 0), 340#(= ~idx~0 0), 407#(= ~idx~0 0), 223#true, 96#L763-1true, 610#(= ~idx~0 0), 169#true, 171#true, 172#true, 492#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 174#true, 559#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), 304#(= ~idx~0 0), 241#(= ~readerprogress1~0 2), 369#(= ~idx~0 0), 178#true, 53#L788-1true, 245#(= ~readerprogress2~0 2), 629#true, 182#true, 58#L758true, 255#(= ~idx~0 0), 639#(= ~idx~0 0)]) [2021-08-12 23:36:13,809 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2021-08-12 23:36:13,809 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:36:13,809 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:36:13,809 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:36:23,372 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([581] L789-->L789-1: Formula: (= |v_ULTIMATE.start_main_#t~mem32_2| (select (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t3~0.base_4|) |v_ULTIMATE.start_main_~#t3~0.offset_4|)) InVars {#memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~#t3~0.base=|v_ULTIMATE.start_main_~#t3~0.base_4|, ULTIMATE.start_main_~#t3~0.offset=|v_ULTIMATE.start_main_~#t3~0.offset_4|} OutVars{#memory_int=|v_#memory_int_20|, ULTIMATE.start_main_#t~mem32=|v_ULTIMATE.start_main_#t~mem32_2|, ULTIMATE.start_main_~#t3~0.base=|v_ULTIMATE.start_main_~#t3~0.base_4|, ULTIMATE.start_main_~#t3~0.offset=|v_ULTIMATE.start_main_~#t3~0.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem32][1405], [194#true, 514#true, 259#(= ~idx~0 1), 261#true, 587#true, 205#true, 271#true, 338#true, 21#L778true, 150#L789-1true, 415#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 608#true, 229#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 486#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 168#true, 555#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 171#true, 172#true, 176#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), 241#(= ~readerprogress1~0 2), 178#true, 245#(= ~readerprogress2~0 2), 312#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 377#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 185#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), 634#(and (= qrcu_reader2Thread1of1ForFork2_~myidx~1 1) (= ~idx~0 1)), 637#true, 253#true, 447#true]) [2021-08-12 23:36:23,372 INFO L384 tUnfolder$Statistics]: this new event has 107 ancestors and is cut-off event [2021-08-12 23:36:23,372 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2021-08-12 23:36:23,372 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2021-08-12 23:36:23,372 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2021-08-12 23:36:23,429 INFO L129 PetriNetUnfolder]: 18664/44841 cut-off events. [2021-08-12 23:36:23,429 INFO L130 PetriNetUnfolder]: For 708278/754911 co-relation queries the response was YES. [2021-08-12 23:36:23,839 INFO L84 FinitePrefix]: Finished finitePrefix Result has 351301 conditions, 44841 events. 18664/44841 cut-off events. For 708278/754911 co-relation queries the response was YES. Maximal size of possible extension queue 2155. Compared 548828 event pairs, 1044 based on Foata normal form. 1566/43603 useless extension candidates. Maximal degree in co-relation 344749. Up to 12501 conditions per place. [2021-08-12 23:36:24,030 INFO L132 encePairwiseOnDemand]: 171/184 looper letters, 589 selfloop transitions, 210 changer transitions 42/1497 dead transitions. [2021-08-12 23:36:24,030 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 1497 transitions, 37296 flow [2021-08-12 23:36:24,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-12 23:36:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-08-12 23:36:24,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1906 transitions. [2021-08-12 23:36:24,032 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8632246376811594 [2021-08-12 23:36:24,032 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1906 transitions. [2021-08-12 23:36:24,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1906 transitions. [2021-08-12 23:36:24,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 23:36:24,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1906 transitions. [2021-08-12 23:36:24,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 158.83333333333334) internal successors, (1906), 12 states have internal predecessors, (1906), 0 states have call successors, (0), 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-08-12 23:36:24,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 184.0) internal successors, (2392), 13 states have internal predecessors, (2392), 0 states have call successors, (0), 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-08-12 23:36:24,035 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 184.0) internal successors, (2392), 13 states have internal predecessors, (2392), 0 states have call successors, (0), 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-08-12 23:36:24,035 INFO L348 CegarLoopForPetriNet]: 156 programPoint places, 225 predicate places. [2021-08-12 23:36:24,035 INFO L482 AbstractCegarLoop]: Abstraction has has 381 places, 1497 transitions, 37296 flow [2021-08-12 23:36:24,035 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 151.125) internal successors, (1209), 8 states have internal predecessors, (1209), 0 states have call successors, (0), 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-08-12 23:36:24,036 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 23:36:24,036 INFO L266 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] [2021-08-12 23:36:24,036 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-12 23:36:24,036 INFO L430 AbstractCegarLoop]: === Iteration 25 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 23:36:24,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 23:36:24,036 INFO L82 PathProgramCache]: Analyzing trace with hash -801492258, now seen corresponding path program 5 times [2021-08-12 23:36:24,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 23:36:24,036 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999137490] [2021-08-12 23:36:24,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 23:36:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 23:36:24,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:24,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:36:24,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:24,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:36:24,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:24,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:36:24,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:24,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:36:24,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:24,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:36:24,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:24,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:36:24,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:24,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:36:24,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:24,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:36:24,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 23:36:24,209 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 23:36:24,209 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999137490] [2021-08-12 23:36:24,209 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999137490] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 23:36:24,209 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 23:36:24,209 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-12 23:36:24,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474652697] [2021-08-12 23:36:24,209 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-12 23:36:24,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 23:36:24,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-12 23:36:24,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-12 23:36:24,210 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 184 [2021-08-12 23:36:24,211 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 1497 transitions, 37296 flow. Second operand has 8 states, 8 states have (on average 151.125) internal successors, (1209), 8 states have internal predecessors, (1209), 0 states have call successors, (0), 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-08-12 23:36:24,211 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 23:36:24,211 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 184 [2021-08-12 23:36:24,211 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 23:36:26,526 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([623] L788-->L788-1: Formula: (= |v_ULTIMATE.start_main_#t~mem31_2| (select (select |v_#memory_int_19| |v_ULTIMATE.start_main_~#t2~0.base_4|) |v_ULTIMATE.start_main_~#t2~0.offset_4|)) InVars {ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|} OutVars{ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|, ULTIMATE.start_main_#t~mem31=|v_ULTIMATE.start_main_#t~mem31_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem31][457], [257#true, 194#true, 261#true, 205#true, 589#(= ~idx~0 0), 462#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 527#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), 656#(= ~idx~0 0), 273#(= ~idx~0 0), 340#(= ~idx~0 0), 407#(= ~idx~0 0), 223#true, 96#L763-1true, 610#(= ~idx~0 0), 169#true, 171#true, 172#true, 492#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 174#true, 559#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), 304#(= ~idx~0 0), 369#(= ~idx~0 0), 241#(= ~readerprogress1~0 2), 178#true, 53#L788-1true, 245#(= ~readerprogress2~0 2), 629#true, 182#true, 58#L758true, 639#(= ~idx~0 0), 255#(= ~idx~0 0)]) [2021-08-12 23:36:26,527 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2021-08-12 23:36:26,527 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:36:26,527 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:36:26,527 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:36:35,907 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([581] L789-->L789-1: Formula: (= |v_ULTIMATE.start_main_#t~mem32_2| (select (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t3~0.base_4|) |v_ULTIMATE.start_main_~#t3~0.offset_4|)) InVars {#memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~#t3~0.base=|v_ULTIMATE.start_main_~#t3~0.base_4|, ULTIMATE.start_main_~#t3~0.offset=|v_ULTIMATE.start_main_~#t3~0.offset_4|} OutVars{#memory_int=|v_#memory_int_20|, ULTIMATE.start_main_#t~mem32=|v_ULTIMATE.start_main_#t~mem32_2|, ULTIMATE.start_main_~#t3~0.base=|v_ULTIMATE.start_main_~#t3~0.base_4|, ULTIMATE.start_main_~#t3~0.offset=|v_ULTIMATE.start_main_~#t3~0.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem32][1484], [194#true, 514#true, 259#(= ~idx~0 1), 261#true, 587#true, 205#true, 654#true, 271#true, 338#true, 21#L778true, 150#L789-1true, 415#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 608#true, 229#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 486#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 168#true, 555#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 171#true, 172#true, 176#(< 1 qrcu_updaterThread1of1ForFork0_~sum~0), 241#(= ~readerprogress1~0 2), 178#true, 245#(= ~readerprogress2~0 2), 312#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 377#(<= 2 qrcu_updaterThread1of1ForFork0_~sum~0), 185#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0.offset|) 0), 634#(and (= qrcu_reader2Thread1of1ForFork2_~myidx~1 1) (= ~idx~0 1)), 637#true, 253#true, 447#true]) [2021-08-12 23:36:35,907 INFO L384 tUnfolder$Statistics]: this new event has 107 ancestors and is cut-off event [2021-08-12 23:36:35,907 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2021-08-12 23:36:35,908 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2021-08-12 23:36:35,908 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2021-08-12 23:36:35,952 INFO L129 PetriNetUnfolder]: 19056/46397 cut-off events. [2021-08-12 23:36:35,952 INFO L130 PetriNetUnfolder]: For 834008/882320 co-relation queries the response was YES. [2021-08-12 23:36:36,502 INFO L84 FinitePrefix]: Finished finitePrefix Result has 381498 conditions, 46397 events. 19056/46397 cut-off events. For 834008/882320 co-relation queries the response was YES. Maximal size of possible extension queue 2197. Compared 573983 event pairs, 1054 based on Foata normal form. 2004/45574 useless extension candidates. Maximal degree in co-relation 374911. Up to 13056 conditions per place. [2021-08-12 23:36:36,695 INFO L132 encePairwiseOnDemand]: 171/184 looper letters, 656 selfloop transitions, 265 changer transitions 46/1623 dead transitions. [2021-08-12 23:36:36,695 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 1623 transitions, 43030 flow [2021-08-12 23:36:36,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-12 23:36:36,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-08-12 23:36:36,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2213 transitions. [2021-08-12 23:36:36,697 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.859083850931677 [2021-08-12 23:36:36,697 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2213 transitions. [2021-08-12 23:36:36,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2213 transitions. [2021-08-12 23:36:36,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 23:36:36,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2213 transitions. [2021-08-12 23:36:36,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 158.07142857142858) internal successors, (2213), 14 states have internal predecessors, (2213), 0 states have call successors, (0), 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-08-12 23:36:36,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 184.0) internal successors, (2760), 15 states have internal predecessors, (2760), 0 states have call successors, (0), 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-08-12 23:36:36,722 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 184.0) internal successors, (2760), 15 states have internal predecessors, (2760), 0 states have call successors, (0), 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-08-12 23:36:36,723 INFO L348 CegarLoopForPetriNet]: 156 programPoint places, 238 predicate places. [2021-08-12 23:36:36,723 INFO L482 AbstractCegarLoop]: Abstraction has has 394 places, 1623 transitions, 43030 flow [2021-08-12 23:36:36,723 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 151.125) internal successors, (1209), 8 states have internal predecessors, (1209), 0 states have call successors, (0), 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-08-12 23:36:36,723 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 23:36:36,723 INFO L266 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] [2021-08-12 23:36:36,724 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-12 23:36:36,724 INFO L430 AbstractCegarLoop]: === Iteration 26 === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 23:36:36,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 23:36:36,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1961196105, now seen corresponding path program 1 times [2021-08-12 23:36:36,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 23:36:36,724 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531026162] [2021-08-12 23:36:36,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 23:36:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 23:36:36,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:36,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:36:36,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:36,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:36:36,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:36,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:36:36,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:36,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 23:36:36,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:36,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:36:36,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:36,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:36:36,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:36,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 23:36:36,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 23:36:36,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 23:36:36,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 23:36:36,780 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 23:36:36,780 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531026162] [2021-08-12 23:36:36,780 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531026162] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 23:36:36,781 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 23:36:36,781 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-12 23:36:36,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400012249] [2021-08-12 23:36:36,781 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-12 23:36:36,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 23:36:36,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-12 23:36:36,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-12 23:36:36,782 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 184 [2021-08-12 23:36:36,783 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 1623 transitions, 43030 flow. Second operand has 8 states, 8 states have (on average 151.125) internal successors, (1209), 8 states have internal predecessors, (1209), 0 states have call successors, (0), 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-08-12 23:36:36,783 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 23:36:36,783 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 184 [2021-08-12 23:36:36,783 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 23:36:39,081 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([623] L788-->L788-1: Formula: (= |v_ULTIMATE.start_main_#t~mem31_2| (select (select |v_#memory_int_19| |v_ULTIMATE.start_main_~#t2~0.base_4|) |v_ULTIMATE.start_main_~#t2~0.offset_4|)) InVars {ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|} OutVars{ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_4|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_4|, ULTIMATE.start_main_#t~mem31=|v_ULTIMATE.start_main_#t~mem31_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem31][460], [257#true, 194#true, 261#true, 589#(= ~idx~0 0), 205#true, 462#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 527#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), 656#(= ~idx~0 0), 273#(= ~idx~0 0), 340#(= ~idx~0 0), 407#(= ~idx~0 0), 223#true, 96#L763-1true, 610#(= ~idx~0 0), 169#true, 171#true, 492#(and (= ~ctr2~0 0) (= ~idx~0 0) (<= 1 ~ctr1~0)), 172#true, 686#(and (= ~ctr2~0 0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), 174#true, 559#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork1_~myidx~0 0)), 304#(= ~idx~0 0), 241#(= ~readerprogress1~0 2), 369#(= ~idx~0 0), 178#true, 629#true, 53#L788-1true, 245#(= ~readerprogress2~0 2), 182#true, 58#L758true, 639#(= ~idx~0 0), 255#(= ~idx~0 0)]) [2021-08-12 23:36:39,081 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2021-08-12 23:36:39,081 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:36:39,081 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-08-12 23:36:39,081 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event