/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-atomic/qrcu-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 13:02:09,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 13:02:09,279 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 13:02:09,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 13:02:09,333 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 13:02:09,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 13:02:09,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 13:02:09,358 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 13:02:09,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 13:02:09,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 13:02:09,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 13:02:09,366 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 13:02:09,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 13:02:09,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 13:02:09,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 13:02:09,374 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 13:02:09,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 13:02:09,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 13:02:09,379 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 13:02:09,380 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 13:02:09,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 13:02:09,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 13:02:09,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 13:02:09,385 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 13:02:09,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 13:02:09,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 13:02:09,391 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 13:02:09,392 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 13:02:09,393 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 13:02:09,393 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 13:02:09,393 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 13:02:09,394 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 13:02:09,395 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 13:02:09,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 13:02:09,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 13:02:09,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 13:02:09,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 13:02:09,398 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 13:02:09,398 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 13:02:09,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 13:02:09,399 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 13:02:09,403 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-RepeatedSemanticLbe.epf [2021-03-25 13:02:09,440 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 13:02:09,440 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 13:02:09,443 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 13:02:09,444 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 13:02:09,444 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 13:02:09,444 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 13:02:09,444 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 13:02:09,444 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 13:02:09,444 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 13:02:09,444 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 13:02:09,445 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 13:02:09,445 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 13:02:09,445 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 13:02:09,445 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 13:02:09,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 13:02:09,446 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 13:02:09,446 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 13:02:09,446 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 13:02:09,446 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 13:02:09,446 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 13:02:09,446 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 13:02:09,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 13:02:09,447 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 13:02:09,447 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 13:02:09,447 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 13:02:09,447 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 13:02:09,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 13:02:09,447 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 13:02:09,447 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 13:02:09,447 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 13:02:09,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 13:02:09,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 13:02:09,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 13:02:09,787 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 13:02:09,788 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 13:02:09,788 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-03-25 13:02:09,845 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d4881473/49686d5bd1664fcdbc4b28885b06b2eb/FLAG30a2f8c3c [2021-03-25 13:02:10,391 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 13:02:10,392 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i [2021-03-25 13:02:10,411 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d4881473/49686d5bd1664fcdbc4b28885b06b2eb/FLAG30a2f8c3c [2021-03-25 13:02:10,709 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d4881473/49686d5bd1664fcdbc4b28885b06b2eb [2021-03-25 13:02:10,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 13:02:10,714 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 13:02:10,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 13:02:10,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 13:02:10,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 13:02:10,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 01:02:10" (1/1) ... [2021-03-25 13:02:10,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@493b761e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 01:02:10, skipping insertion in model container [2021-03-25 13:02:10,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 01:02:10" (1/1) ... [2021-03-25 13:02:10,748 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 13:02:10,829 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 13:02:11,321 WARN L226 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-03-25 13:02:11,327 WARN L226 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-03-25 13:02:11,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 13:02:11,357 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 13:02:11,397 WARN L226 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-03-25 13:02:11,399 WARN L226 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-03-25 13:02:11,420 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 13:02:11,491 INFO L208 MainTranslator]: Completed translation [2021-03-25 13:02:11,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 01:02:11 WrapperNode [2021-03-25 13:02:11,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 13:02:11,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 13:02:11,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 13:02:11,494 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 13:02:11,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 01:02:11" (1/1) ... [2021-03-25 13:02:11,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 01:02:11" (1/1) ... [2021-03-25 13:02:11,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 13:02:11,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 13:02:11,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 13:02:11,579 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 13:02:11,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 01:02:11" (1/1) ... [2021-03-25 13:02:11,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 01:02:11" (1/1) ... [2021-03-25 13:02:11,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 01:02:11" (1/1) ... [2021-03-25 13:02:11,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 01:02:11" (1/1) ... [2021-03-25 13:02:11,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 01:02:11" (1/1) ... [2021-03-25 13:02:11,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 01:02:11" (1/1) ... [2021-03-25 13:02:11,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 01:02:11" (1/1) ... [2021-03-25 13:02:11,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 13:02:11,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 13:02:11,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 13:02:11,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 13:02:11,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 01:02:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 13:02:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader1 [2021-03-25 13:02:11,703 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader1 [2021-03-25 13:02:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader2 [2021-03-25 13:02:11,704 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader2 [2021-03-25 13:02:11,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-25 13:02:11,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 13:02:11,706 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_updater [2021-03-25 13:02:11,706 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_updater [2021-03-25 13:02:11,706 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-03-25 13:02:11,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 13:02:11,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 13:02:11,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 13:02:11,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 13:02:11,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 13:02:11,708 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 13:02:12,760 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 13:02:12,760 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-03-25 13:02:12,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 01:02:12 BoogieIcfgContainer [2021-03-25 13:02:12,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 13:02:12,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 13:02:12,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 13:02:12,766 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 13:02:12,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 01:02:10" (1/3) ... [2021-03-25 13:02:12,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782aba03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 01:02:12, skipping insertion in model container [2021-03-25 13:02:12,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 01:02:11" (2/3) ... [2021-03-25 13:02:12,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782aba03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 01:02:12, skipping insertion in model container [2021-03-25 13:02:12,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 01:02:12" (3/3) ... [2021-03-25 13:02:12,769 INFO L111 eAbstractionObserver]: Analyzing ICFG qrcu-1.i [2021-03-25 13:02:12,775 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 13:02:12,781 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 13:02:12,782 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 13:02:12,829 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,830 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,830 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,830 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,830 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,830 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,831 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,831 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,831 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,831 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,831 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,832 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,832 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,832 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,833 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,833 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,833 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,833 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,833 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,834 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,834 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,834 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,834 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,835 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,836 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,836 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,836 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,836 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,836 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,837 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,837 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,837 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,837 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,838 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,838 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,838 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,838 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,838 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,838 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,839 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,839 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,839 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,839 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,839 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,839 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,840 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,840 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,840 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,841 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,841 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,841 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,842 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,842 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,842 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,842 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,842 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,842 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,843 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,843 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,843 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,843 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,843 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,843 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,843 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,844 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,844 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,844 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,844 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,845 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,845 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,845 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,845 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,846 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,846 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,846 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,846 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,846 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,846 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,846 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,847 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,847 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,847 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,848 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,848 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,848 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,848 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,848 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,848 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,849 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,849 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,849 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,849 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,850 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,850 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,850 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,850 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,851 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,852 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,855 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,855 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,855 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,856 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,862 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,862 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,862 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,862 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,862 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,862 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,863 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,863 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,863 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,863 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,863 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,863 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,863 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,864 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,864 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,864 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,864 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,864 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,864 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,864 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,865 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,865 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,865 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,865 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,865 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,865 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,866 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,866 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,866 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,866 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,867 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,867 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,867 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,867 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,867 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,867 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,867 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,868 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,871 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,871 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,871 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,871 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,871 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,871 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,872 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,872 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,872 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,872 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,872 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,872 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,872 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,873 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,873 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,873 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,873 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,873 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,873 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,874 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,874 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,874 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,874 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,874 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,874 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,874 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,874 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,875 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,875 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,875 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,875 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,875 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,875 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,875 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,876 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,876 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,876 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,876 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,876 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,876 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,876 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,876 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,877 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,877 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,877 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,877 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,877 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,877 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,878 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,878 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,878 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,878 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,878 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,878 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,878 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,879 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,879 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,879 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,879 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,879 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,879 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,880 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,880 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,880 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,880 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,880 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,880 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,881 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,881 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,881 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,887 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,888 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,888 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,888 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,888 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,888 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,889 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,889 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,889 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,889 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,889 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,889 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,890 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,890 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,891 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,894 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,894 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,894 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,894 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,896 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,897 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,897 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,897 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,897 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,898 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,898 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,898 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,898 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,898 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,898 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,899 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,899 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,899 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,899 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,899 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,899 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,899 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,899 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,900 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,900 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,900 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,900 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,900 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,900 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,900 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,900 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,901 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,901 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,901 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,901 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,901 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,901 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,901 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,902 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,902 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,902 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,902 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,902 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,902 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,902 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,903 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,903 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,903 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,903 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,903 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,903 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,903 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,903 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,904 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,904 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,904 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,904 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,904 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,904 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,904 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,904 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,905 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,905 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,905 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,905 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,905 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,905 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,905 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,905 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,906 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,906 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,906 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,906 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,906 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,906 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,906 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,907 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,907 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,907 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,907 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,907 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,907 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,907 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,908 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,908 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,908 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,908 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,908 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,908 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,908 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,908 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,908 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,909 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,909 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,909 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,909 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,910 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,910 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,910 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,910 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,910 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,910 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,910 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,911 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,911 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,911 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,911 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,911 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,911 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,912 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,912 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,912 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,912 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,912 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,912 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,912 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,912 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,913 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,913 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,913 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,913 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,913 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,913 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,913 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,913 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,914 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,914 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,916 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,916 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,916 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,916 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,916 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,916 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,919 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,919 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,919 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,920 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,920 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,920 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,920 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,920 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,920 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,921 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,921 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,921 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,921 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,923 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,923 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,923 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,923 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,924 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,924 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,924 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,924 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,924 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,924 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,924 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,925 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,925 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,925 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,925 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,925 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,925 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,925 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,926 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,927 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,927 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,927 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,927 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,927 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,928 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,928 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,928 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,928 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,928 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,928 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,928 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,929 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,929 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,929 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,929 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,929 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,929 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,929 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,930 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,930 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,930 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,930 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,930 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,930 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,930 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,931 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,931 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,931 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,931 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,931 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,931 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,931 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,932 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,932 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 13:02:12,939 INFO L149 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2021-03-25 13:02:12,958 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 13:02:12,982 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 13:02:12,982 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 13:02:12,982 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 13:02:12,982 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 13:02:12,982 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 13:02:12,982 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 13:02:12,982 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 13:02:12,982 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 13:02:12,996 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 161 places, 175 transitions, 392 flow [2021-03-25 13:02:13,053 INFO L129 PetriNetUnfolder]: 23/183 cut-off events. [2021-03-25 13:02:13,054 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-03-25 13:02:13,059 INFO L84 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 183 events. 23/183 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 449 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 141. Up to 6 conditions per place. [2021-03-25 13:02:13,059 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 175 transitions, 392 flow [2021-03-25 13:02:13,065 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 159 transitions, 345 flow [2021-03-25 13:02:13,067 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:13,077 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 159 transitions, 345 flow [2021-03-25 13:02:13,080 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 159 transitions, 345 flow [2021-03-25 13:02:13,087 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 159 transitions, 345 flow [2021-03-25 13:02:13,154 INFO L129 PetriNetUnfolder]: 21/170 cut-off events. [2021-03-25 13:02:13,155 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-03-25 13:02:13,157 INFO L84 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 170 events. 21/170 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 433 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 141. Up to 6 conditions per place. [2021-03-25 13:02:13,163 INFO L142 LiptonReduction]: Number of co-enabled transitions 10120 [2021-03-25 13:02:15,470 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-03-25 13:02:18,101 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-03-25 13:02:18,310 INFO L154 LiptonReduction]: Checked pairs total: 12308 [2021-03-25 13:02:18,310 INFO L156 LiptonReduction]: Total number of compositions: 85 [2021-03-25 13:02:18,313 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5247 [2021-03-25 13:02:18,334 INFO L129 PetriNetUnfolder]: 8/53 cut-off events. [2021-03-25 13:02:18,334 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 13:02:18,334 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:18,335 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 13:02:18,335 INFO L428 AbstractCegarLoop]: === Iteration 1 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:18,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:18,342 INFO L82 PathProgramCache]: Analyzing trace with hash 392022303, now seen corresponding path program 1 times [2021-03-25 13:02:18,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:18,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064056518] [2021-03-25 13:02:18,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:18,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:18,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 13:02:18,635 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 13:02:18,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:18,646 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 13:02:18,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:18,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:18,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:18,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:18,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 13:02:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 13:02:18,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064056518] [2021-03-25 13:02:18,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:18,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 13:02:18,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612734178] [2021-03-25 13:02:18,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 13:02:18,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:18,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 13:02:18,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 13:02:18,687 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 260 [2021-03-25 13:02:18,692 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 86 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 181.4) internal successors, (907), 5 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:18,693 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:18,693 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 260 [2021-03-25 13:02:18,694 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:19,016 INFO L129 PetriNetUnfolder]: 467/1088 cut-off events. [2021-03-25 13:02:19,016 INFO L130 PetriNetUnfolder]: For 107/107 co-relation queries the response was YES. [2021-03-25 13:02:19,023 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1876 conditions, 1088 events. 467/1088 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6966 event pairs, 137 based on Foata normal form. 135/1095 useless extension candidates. Maximal degree in co-relation 1760. Up to 523 conditions per place. [2021-03-25 13:02:19,030 INFO L132 encePairwiseOnDemand]: 242/260 looper letters, 45 selfloop transitions, 19 changer transitions 0/115 dead transitions. [2021-03-25 13:02:19,031 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 115 transitions, 388 flow [2021-03-25 13:02:19,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 13:02:19,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 13:02:19,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1164 transitions. [2021-03-25 13:02:19,054 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7461538461538462 [2021-03-25 13:02:19,054 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1164 transitions. [2021-03-25 13:02:19,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1164 transitions. [2021-03-25 13:02:19,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:19,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1164 transitions. [2021-03-25 13:02:19,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 194.0) internal successors, (1164), 6 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:19,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:19,075 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:19,077 INFO L185 Difference]: Start difference. First operand has 78 places, 86 transitions, 199 flow. Second operand 6 states and 1164 transitions. [2021-03-25 13:02:19,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 115 transitions, 388 flow [2021-03-25 13:02:19,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 115 transitions, 368 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-03-25 13:02:19,087 INFO L241 Difference]: Finished difference. Result has 82 places, 104 transitions, 339 flow [2021-03-25 13:02:19,089 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=339, PETRI_PLACES=82, PETRI_TRANSITIONS=104} [2021-03-25 13:02:19,089 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 4 predicate places. [2021-03-25 13:02:19,089 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:19,090 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 104 transitions, 339 flow [2021-03-25 13:02:19,090 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 104 transitions, 339 flow [2021-03-25 13:02:19,091 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 104 transitions, 339 flow [2021-03-25 13:02:19,124 INFO L129 PetriNetUnfolder]: 100/433 cut-off events. [2021-03-25 13:02:19,124 INFO L130 PetriNetUnfolder]: For 105/116 co-relation queries the response was YES. [2021-03-25 13:02:19,126 INFO L84 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 433 events. 100/433 cut-off events. For 105/116 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2768 event pairs, 1 based on Foata normal form. 1/398 useless extension candidates. Maximal degree in co-relation 505. Up to 42 conditions per place. [2021-03-25 13:02:19,133 INFO L142 LiptonReduction]: Number of co-enabled transitions 4322 [2021-03-25 13:02:20,834 INFO L154 LiptonReduction]: Checked pairs total: 8618 [2021-03-25 13:02:20,834 INFO L156 LiptonReduction]: Total number of compositions: 20 [2021-03-25 13:02:20,835 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1746 [2021-03-25 13:02:20,836 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 95 transitions, 321 flow [2021-03-25 13:02:20,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 181.4) internal successors, (907), 5 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:20,837 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:20,837 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 13:02:20,837 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 13:02:20,837 INFO L428 AbstractCegarLoop]: === Iteration 2 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:20,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:20,838 INFO L82 PathProgramCache]: Analyzing trace with hash -727867361, now seen corresponding path program 1 times [2021-03-25 13:02:20,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:20,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587074562] [2021-03-25 13:02:20,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:20,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:20,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 13:02:20,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:20,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:20,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 13:02:20,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587074562] [2021-03-25 13:02:20,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:20,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 13:02:20,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59779918] [2021-03-25 13:02:20,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 13:02:20,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:20,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 13:02:20,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 13:02:20,945 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 280 [2021-03-25 13:02:20,946 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 95 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:20,947 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:20,947 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 280 [2021-03-25 13:02:20,947 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:21,004 INFO L129 PetriNetUnfolder]: 113/447 cut-off events. [2021-03-25 13:02:21,004 INFO L130 PetriNetUnfolder]: For 105/112 co-relation queries the response was YES. [2021-03-25 13:02:21,007 INFO L84 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 447 events. 113/447 cut-off events. For 105/112 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2835 event pairs, 6 based on Foata normal form. 8/414 useless extension candidates. Maximal degree in co-relation 544. Up to 48 conditions per place. [2021-03-25 13:02:21,009 INFO L132 encePairwiseOnDemand]: 277/280 looper letters, 6 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2021-03-25 13:02:21,009 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 97 transitions, 341 flow [2021-03-25 13:02:21,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 13:02:21,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 13:02:21,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 777 transitions. [2021-03-25 13:02:21,011 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.925 [2021-03-25 13:02:21,012 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 777 transitions. [2021-03-25 13:02:21,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 777 transitions. [2021-03-25 13:02:21,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:21,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 777 transitions. [2021-03-25 13:02:21,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 259.0) internal successors, (777), 3 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-03-25 13:02:21,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:21,016 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:21,016 INFO L185 Difference]: Start difference. First operand has 73 places, 95 transitions, 321 flow. Second operand 3 states and 777 transitions. [2021-03-25 13:02:21,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 97 transitions, 341 flow [2021-03-25 13:02:21,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 97 transitions, 341 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 13:02:21,023 INFO L241 Difference]: Finished difference. Result has 76 places, 95 transitions, 329 flow [2021-03-25 13:02:21,024 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=329, PETRI_PLACES=76, PETRI_TRANSITIONS=95} [2021-03-25 13:02:21,024 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, -2 predicate places. [2021-03-25 13:02:21,024 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:21,024 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 95 transitions, 329 flow [2021-03-25 13:02:21,025 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 95 transitions, 329 flow [2021-03-25 13:02:21,026 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 95 transitions, 329 flow [2021-03-25 13:02:21,053 INFO L129 PetriNetUnfolder]: 102/409 cut-off events. [2021-03-25 13:02:21,053 INFO L130 PetriNetUnfolder]: For 110/121 co-relation queries the response was YES. [2021-03-25 13:02:21,055 INFO L84 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 409 events. 102/409 cut-off events. For 110/121 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2607 event pairs, 1 based on Foata normal form. 1/381 useless extension candidates. Maximal degree in co-relation 516. Up to 42 conditions per place. [2021-03-25 13:02:21,059 INFO L142 LiptonReduction]: Number of co-enabled transitions 3716 [2021-03-25 13:02:21,558 WARN L205 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 119 [2021-03-25 13:02:21,723 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-25 13:02:22,120 WARN L205 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 119 [2021-03-25 13:02:22,278 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-25 13:02:22,985 INFO L154 LiptonReduction]: Checked pairs total: 4646 [2021-03-25 13:02:22,985 INFO L156 LiptonReduction]: Total number of compositions: 17 [2021-03-25 13:02:22,985 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1961 [2021-03-25 13:02:22,986 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 89 transitions, 317 flow [2021-03-25 13:02:22,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:22,987 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:22,987 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 13:02:22,987 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 13:02:22,987 INFO L428 AbstractCegarLoop]: === Iteration 3 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:22,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:22,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1127746976, now seen corresponding path program 1 times [2021-03-25 13:02:22,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:22,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617749436] [2021-03-25 13:02:22,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:23,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:23,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 13:02:23,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:23,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:23,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 13:02:23,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617749436] [2021-03-25 13:02:23,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:23,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 13:02:23,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130565388] [2021-03-25 13:02:23,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 13:02:23,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:23,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 13:02:23,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 13:02:23,072 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 297 [2021-03-25 13:02:23,073 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 89 transitions, 317 flow. Second operand has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:23,073 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:23,073 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 297 [2021-03-25 13:02:23,073 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:23,123 INFO L129 PetriNetUnfolder]: 119/451 cut-off events. [2021-03-25 13:02:23,123 INFO L130 PetriNetUnfolder]: For 98/104 co-relation queries the response was YES. [2021-03-25 13:02:23,125 INFO L84 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 451 events. 119/451 cut-off events. For 98/104 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2972 event pairs, 8 based on Foata normal form. 7/423 useless extension candidates. Maximal degree in co-relation 556. Up to 60 conditions per place. [2021-03-25 13:02:23,128 INFO L132 encePairwiseOnDemand]: 294/297 looper letters, 6 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2021-03-25 13:02:23,128 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 91 transitions, 337 flow [2021-03-25 13:02:23,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 13:02:23,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 13:02:23,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 813 transitions. [2021-03-25 13:02:23,130 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9124579124579124 [2021-03-25 13:02:23,130 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 813 transitions. [2021-03-25 13:02:23,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 813 transitions. [2021-03-25 13:02:23,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:23,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 813 transitions. [2021-03-25 13:02:23,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 271.0) internal successors, (813), 3 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-03-25 13:02:23,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:23,135 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:23,135 INFO L185 Difference]: Start difference. First operand has 70 places, 89 transitions, 317 flow. Second operand 3 states and 813 transitions. [2021-03-25 13:02:23,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 91 transitions, 337 flow [2021-03-25 13:02:23,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 91 transitions, 333 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 13:02:23,141 INFO L241 Difference]: Finished difference. Result has 71 places, 89 transitions, 321 flow [2021-03-25 13:02:23,141 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=321, PETRI_PLACES=71, PETRI_TRANSITIONS=89} [2021-03-25 13:02:23,141 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, -7 predicate places. [2021-03-25 13:02:23,141 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:23,142 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 89 transitions, 321 flow [2021-03-25 13:02:23,142 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 89 transitions, 321 flow [2021-03-25 13:02:23,143 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 89 transitions, 321 flow [2021-03-25 13:02:23,189 INFO L129 PetriNetUnfolder]: 97/394 cut-off events. [2021-03-25 13:02:23,189 INFO L130 PetriNetUnfolder]: For 95/100 co-relation queries the response was YES. [2021-03-25 13:02:23,190 INFO L84 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 394 events. 97/394 cut-off events. For 95/100 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2564 event pairs, 3 based on Foata normal form. 1/377 useless extension candidates. Maximal degree in co-relation 495. Up to 50 conditions per place. [2021-03-25 13:02:23,195 INFO L142 LiptonReduction]: Number of co-enabled transitions 3086 [2021-03-25 13:02:23,437 INFO L154 LiptonReduction]: Checked pairs total: 5178 [2021-03-25 13:02:23,438 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 13:02:23,438 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 297 [2021-03-25 13:02:23,439 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 89 transitions, 321 flow [2021-03-25 13:02:23,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:23,439 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:23,439 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 13:02:23,439 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 13:02:23,440 INFO L428 AbstractCegarLoop]: === Iteration 4 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:23,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:23,440 INFO L82 PathProgramCache]: Analyzing trace with hash 274289960, now seen corresponding path program 1 times [2021-03-25 13:02:23,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:23,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897453154] [2021-03-25 13:02:23,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:23,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:23,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:23,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:23,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:23,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:23,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:23,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 13:02:23,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897453154] [2021-03-25 13:02:23,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:23,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 13:02:23,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243530893] [2021-03-25 13:02:23,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 13:02:23,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:23,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 13:02:23,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 13:02:23,541 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 302 [2021-03-25 13:02:23,543 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 89 transitions, 321 flow. Second operand has 5 states, 5 states have (on average 223.6) internal successors, (1118), 5 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:23,543 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:23,543 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 302 [2021-03-25 13:02:23,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:23,785 INFO L129 PetriNetUnfolder]: 666/1696 cut-off events. [2021-03-25 13:02:23,785 INFO L130 PetriNetUnfolder]: For 425/522 co-relation queries the response was YES. [2021-03-25 13:02:23,794 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3398 conditions, 1696 events. 666/1696 cut-off events. For 425/522 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12964 event pairs, 125 based on Foata normal form. 40/1582 useless extension candidates. Maximal degree in co-relation 2025. Up to 342 conditions per place. [2021-03-25 13:02:23,803 INFO L132 encePairwiseOnDemand]: 292/302 looper letters, 33 selfloop transitions, 18 changer transitions 0/122 dead transitions. [2021-03-25 13:02:23,803 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 122 transitions, 506 flow [2021-03-25 13:02:23,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 13:02:23,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 13:02:23,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1604 transitions. [2021-03-25 13:02:23,808 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7587511825922422 [2021-03-25 13:02:23,808 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1604 transitions. [2021-03-25 13:02:23,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1604 transitions. [2021-03-25 13:02:23,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:23,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1604 transitions. [2021-03-25 13:02:23,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 229.14285714285714) internal successors, (1604), 7 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:23,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:23,817 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:23,817 INFO L185 Difference]: Start difference. First operand has 71 places, 89 transitions, 321 flow. Second operand 7 states and 1604 transitions. [2021-03-25 13:02:23,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 122 transitions, 506 flow [2021-03-25 13:02:23,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 122 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 13:02:23,825 INFO L241 Difference]: Finished difference. Result has 77 places, 104 transitions, 427 flow [2021-03-25 13:02:23,825 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=427, PETRI_PLACES=77, PETRI_TRANSITIONS=104} [2021-03-25 13:02:23,825 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, -1 predicate places. [2021-03-25 13:02:23,826 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:23,826 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 104 transitions, 427 flow [2021-03-25 13:02:23,826 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 104 transitions, 427 flow [2021-03-25 13:02:23,826 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 77 places, 104 transitions, 427 flow [2021-03-25 13:02:23,862 INFO L129 PetriNetUnfolder]: 145/548 cut-off events. [2021-03-25 13:02:23,862 INFO L130 PetriNetUnfolder]: For 145/146 co-relation queries the response was YES. [2021-03-25 13:02:23,865 INFO L84 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 548 events. 145/548 cut-off events. For 145/146 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3882 event pairs, 3 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 846. Up to 52 conditions per place. [2021-03-25 13:02:23,871 INFO L142 LiptonReduction]: Number of co-enabled transitions 3518 [2021-03-25 13:02:23,940 INFO L154 LiptonReduction]: Checked pairs total: 1822 [2021-03-25 13:02:23,941 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 13:02:23,941 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 115 [2021-03-25 13:02:23,942 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 104 transitions, 427 flow [2021-03-25 13:02:23,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 223.6) internal successors, (1118), 5 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:23,943 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:23,943 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 13:02:23,943 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 13:02:23,943 INFO L428 AbstractCegarLoop]: === Iteration 5 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:23,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:23,943 INFO L82 PathProgramCache]: Analyzing trace with hash 324852874, now seen corresponding path program 1 times [2021-03-25 13:02:23,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:23,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143648033] [2021-03-25 13:02:23,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:23,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:23,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:23,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:23,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 13:02:24,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143648033] [2021-03-25 13:02:24,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:24,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 13:02:24,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519057649] [2021-03-25 13:02:24,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 13:02:24,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:24,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 13:02:24,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 13:02:24,005 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 302 [2021-03-25 13:02:24,006 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 104 transitions, 427 flow. Second operand has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:24,006 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:24,006 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 302 [2021-03-25 13:02:24,006 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:24,308 INFO L129 PetriNetUnfolder]: 1015/2484 cut-off events. [2021-03-25 13:02:24,308 INFO L130 PetriNetUnfolder]: For 1394/1506 co-relation queries the response was YES. [2021-03-25 13:02:24,319 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5530 conditions, 2484 events. 1015/2484 cut-off events. For 1394/1506 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 19789 event pairs, 120 based on Foata normal form. 58/2335 useless extension candidates. Maximal degree in co-relation 4727. Up to 540 conditions per place. [2021-03-25 13:02:24,333 INFO L132 encePairwiseOnDemand]: 296/302 looper letters, 58 selfloop transitions, 12 changer transitions 2/146 dead transitions. [2021-03-25 13:02:24,333 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 146 transitions, 758 flow [2021-03-25 13:02:24,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 13:02:24,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 13:02:24,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1164 transitions. [2021-03-25 13:02:24,337 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7708609271523179 [2021-03-25 13:02:24,337 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1164 transitions. [2021-03-25 13:02:24,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1164 transitions. [2021-03-25 13:02:24,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:24,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1164 transitions. [2021-03-25 13:02:24,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 232.8) internal successors, (1164), 5 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:24,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 302.0) internal successors, (1812), 6 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:24,343 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 302.0) internal successors, (1812), 6 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:24,343 INFO L185 Difference]: Start difference. First operand has 77 places, 104 transitions, 427 flow. Second operand 5 states and 1164 transitions. [2021-03-25 13:02:24,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 146 transitions, 758 flow [2021-03-25 13:02:24,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 146 transitions, 758 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 13:02:24,355 INFO L241 Difference]: Finished difference. Result has 84 places, 114 transitions, 537 flow [2021-03-25 13:02:24,355 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=537, PETRI_PLACES=84, PETRI_TRANSITIONS=114} [2021-03-25 13:02:24,355 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 6 predicate places. [2021-03-25 13:02:24,355 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:24,356 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 114 transitions, 537 flow [2021-03-25 13:02:24,356 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 114 transitions, 537 flow [2021-03-25 13:02:24,357 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 114 transitions, 537 flow [2021-03-25 13:02:24,413 INFO L129 PetriNetUnfolder]: 203/781 cut-off events. [2021-03-25 13:02:24,414 INFO L130 PetriNetUnfolder]: For 284/301 co-relation queries the response was YES. [2021-03-25 13:02:24,418 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1471 conditions, 781 events. 203/781 cut-off events. For 284/301 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6110 event pairs, 7 based on Foata normal form. 9/748 useless extension candidates. Maximal degree in co-relation 1255. Up to 76 conditions per place. [2021-03-25 13:02:24,428 INFO L142 LiptonReduction]: Number of co-enabled transitions 3678 [2021-03-25 13:02:24,462 INFO L154 LiptonReduction]: Checked pairs total: 1579 [2021-03-25 13:02:24,462 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 13:02:24,462 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 107 [2021-03-25 13:02:24,463 INFO L480 AbstractCegarLoop]: Abstraction has has 84 places, 114 transitions, 537 flow [2021-03-25 13:02:24,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:24,464 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:24,464 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 13:02:24,464 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 13:02:24,464 INFO L428 AbstractCegarLoop]: === Iteration 6 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:24,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:24,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1162411685, now seen corresponding path program 1 times [2021-03-25 13:02:24,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:24,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244240683] [2021-03-25 13:02:24,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:24,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:24,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 13:02:24,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:24,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 13:02:24,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:24,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 13:02:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 13:02:24,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244240683] [2021-03-25 13:02:24,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:24,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 13:02:24,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444653487] [2021-03-25 13:02:24,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 13:02:24,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:24,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 13:02:24,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 13:02:24,497 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 302 [2021-03-25 13:02:24,498 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 114 transitions, 537 flow. Second operand has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:24,498 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:24,498 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 302 [2021-03-25 13:02:24,498 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:24,597 INFO L129 PetriNetUnfolder]: 202/774 cut-off events. [2021-03-25 13:02:24,597 INFO L130 PetriNetUnfolder]: For 359/459 co-relation queries the response was YES. [2021-03-25 13:02:24,601 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1624 conditions, 774 events. 202/774 cut-off events. For 359/459 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5879 event pairs, 8 based on Foata normal form. 21/757 useless extension candidates. Maximal degree in co-relation 1496. Up to 110 conditions per place. [2021-03-25 13:02:24,605 INFO L132 encePairwiseOnDemand]: 299/302 looper letters, 34 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2021-03-25 13:02:24,605 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 115 transitions, 615 flow [2021-03-25 13:02:24,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 13:02:24,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 13:02:24,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 800 transitions. [2021-03-25 13:02:24,608 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8830022075055187 [2021-03-25 13:02:24,608 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 800 transitions. [2021-03-25 13:02:24,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 800 transitions. [2021-03-25 13:02:24,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:24,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 800 transitions. [2021-03-25 13:02:24,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:24,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:24,613 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:24,613 INFO L185 Difference]: Start difference. First operand has 84 places, 114 transitions, 537 flow. Second operand 3 states and 800 transitions. [2021-03-25 13:02:24,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 115 transitions, 615 flow [2021-03-25 13:02:24,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 115 transitions, 615 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 13:02:24,618 INFO L241 Difference]: Finished difference. Result has 88 places, 115 transitions, 559 flow [2021-03-25 13:02:24,619 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=559, PETRI_PLACES=88, PETRI_TRANSITIONS=115} [2021-03-25 13:02:24,619 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 10 predicate places. [2021-03-25 13:02:24,619 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:24,619 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 115 transitions, 559 flow [2021-03-25 13:02:24,619 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 115 transitions, 559 flow [2021-03-25 13:02:24,620 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 115 transitions, 559 flow [2021-03-25 13:02:24,687 INFO L129 PetriNetUnfolder]: 205/798 cut-off events. [2021-03-25 13:02:24,688 INFO L130 PetriNetUnfolder]: For 407/424 co-relation queries the response was YES. [2021-03-25 13:02:24,692 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 798 events. 205/798 cut-off events. For 407/424 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6279 event pairs, 8 based on Foata normal form. 10/766 useless extension candidates. Maximal degree in co-relation 1339. Up to 78 conditions per place. [2021-03-25 13:02:24,703 INFO L142 LiptonReduction]: Number of co-enabled transitions 3732 [2021-03-25 13:02:24,762 INFO L154 LiptonReduction]: Checked pairs total: 1594 [2021-03-25 13:02:24,762 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 13:02:24,762 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 143 [2021-03-25 13:02:24,763 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 115 transitions, 559 flow [2021-03-25 13:02:24,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:24,763 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:24,763 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 13:02:24,763 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 13:02:24,763 INFO L428 AbstractCegarLoop]: === Iteration 7 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:24,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:24,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1679367001, now seen corresponding path program 1 times [2021-03-25 13:02:24,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:24,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783631626] [2021-03-25 13:02:24,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:24,805 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 13:02:24,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:24,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:24,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:24,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:24,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:24,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:24,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:24,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:24,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 13:02:24,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 13:02:24,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783631626] [2021-03-25 13:02:24,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:24,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 13:02:24,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079518423] [2021-03-25 13:02:24,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 13:02:24,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:24,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 13:02:24,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 13:02:24,838 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 302 [2021-03-25 13:02:24,839 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 115 transitions, 559 flow. Second operand has 6 states, 6 states have (on average 206.5) internal successors, (1239), 6 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:24,839 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:24,840 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 302 [2021-03-25 13:02:24,840 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:25,343 INFO L129 PetriNetUnfolder]: 1036/2271 cut-off events. [2021-03-25 13:02:25,344 INFO L130 PetriNetUnfolder]: For 2484/2505 co-relation queries the response was YES. [2021-03-25 13:02:25,356 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5816 conditions, 2271 events. 1036/2271 cut-off events. For 2484/2505 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 17574 event pairs, 47 based on Foata normal form. 139/2316 useless extension candidates. Maximal degree in co-relation 5415. Up to 771 conditions per place. [2021-03-25 13:02:25,368 INFO L132 encePairwiseOnDemand]: 278/302 looper letters, 103 selfloop transitions, 29 changer transitions 0/180 dead transitions. [2021-03-25 13:02:25,368 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 180 transitions, 1165 flow [2021-03-25 13:02:25,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 13:02:25,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 13:02:25,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1548 transitions. [2021-03-25 13:02:25,373 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7322611163670766 [2021-03-25 13:02:25,373 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1548 transitions. [2021-03-25 13:02:25,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1548 transitions. [2021-03-25 13:02:25,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:25,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1548 transitions. [2021-03-25 13:02:25,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 221.14285714285714) internal successors, (1548), 7 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:25,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:25,381 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:25,381 INFO L185 Difference]: Start difference. First operand has 88 places, 115 transitions, 559 flow. Second operand 7 states and 1548 transitions. [2021-03-25 13:02:25,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 180 transitions, 1165 flow [2021-03-25 13:02:25,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 180 transitions, 1153 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-25 13:02:25,396 INFO L241 Difference]: Finished difference. Result has 98 places, 139 transitions, 832 flow [2021-03-25 13:02:25,396 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=832, PETRI_PLACES=98, PETRI_TRANSITIONS=139} [2021-03-25 13:02:25,396 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 20 predicate places. [2021-03-25 13:02:25,396 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:25,397 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 139 transitions, 832 flow [2021-03-25 13:02:25,397 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 139 transitions, 832 flow [2021-03-25 13:02:25,398 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 98 places, 139 transitions, 832 flow [2021-03-25 13:02:25,454 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= v_qrcu_updaterThread1of1ForFork2_~sum~0_127 v_~ctr2~0_313) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_128 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_128, ~ctr2~0=v_~ctr2~0_313} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_127, ~ctr2~0=v_~ctr2~0_313} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][87], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 100#qrcu_reader1EXITtrue, 165#true, 135#L767-8true, Black: 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 227#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 229#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 192#(= ~readerprogress1~0 0), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 223#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 45#L744-3true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~readerprogress2~0 0), Black: 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 21#L786-2true, Black: 182#(= ~readerprogress1~0 0), Black: 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 220#true]) [2021-03-25 13:02:25,454 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 13:02:25,454 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 13:02:25,454 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 13:02:25,455 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 13:02:25,466 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= v_qrcu_updaterThread1of1ForFork2_~sum~0_127 v_~ctr2~0_313) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_128 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_128, ~ctr2~0=v_~ctr2~0_313} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_127, ~ctr2~0=v_~ctr2~0_313} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][87], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 100#qrcu_reader1EXITtrue, 165#true, 135#L767-8true, Black: 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 227#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 229#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 192#(= ~readerprogress1~0 0), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 223#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 45#L744-3true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, Black: 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 182#(= ~readerprogress1~0 0), Black: 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 220#true]) [2021-03-25 13:02:25,466 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 13:02:25,466 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 13:02:25,466 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 13:02:25,466 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 13:02:25,466 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 13:02:25,466 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([798] L766-8-->L767-10: Formula: (not (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_17 1)) InVars {qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_17} OutVars{qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_17} AuxVars[] AssignedVars[][118], [225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 100#qrcu_reader1EXITtrue, 165#true, Black: 227#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 229#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 192#(= ~readerprogress1~0 0), Black: 220#true, Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 223#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 140#L767-10true, 45#L744-3true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, Black: 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 182#(= ~readerprogress1~0 0), Black: 214#true]) [2021-03-25 13:02:25,466 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 13:02:25,466 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 13:02:25,466 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 13:02:25,467 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 13:02:25,470 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([946] L766-8-->L767-4: Formula: (and (<= 0 (+ |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483648)) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_132 1) (not (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 0)) (<= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483647) (= v_qrcu_updaterThread1of1ForFork2_~sum~0_131 v_~ctr1~0_341)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36|, ~ctr1~0=v_~ctr1~0_341, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_132} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_35|, ~ctr1~0=v_~ctr1~0_341, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_131} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][35], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 100#qrcu_reader1EXITtrue, 165#true, Black: 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 227#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 229#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 192#(= ~readerprogress1~0 0), Black: 223#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 45#L744-3true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, Black: 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 182#(= ~readerprogress1~0 0), Black: 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 220#true, 157#L767-4true]) [2021-03-25 13:02:25,470 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-25 13:02:25,470 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 13:02:25,470 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 13:02:25,471 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 13:02:25,520 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([914] L767-10-->L770-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_16| |v_~#mutex~0.base_22|))) (and (= (select .cse0 |v_~#mutex~0.offset_22|) 0) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7| 0) (= (store |v_#pthreadsMutex_16| |v_~#mutex~0.base_22| (store .cse0 |v_~#mutex~0.offset_22| 1)) |v_#pthreadsMutex_15|) (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_51))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_#t~nondet17=|v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~nondet17][115], [225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 100#qrcu_reader1EXITtrue, 165#true, Black: 227#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 229#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 220#true, 138#L770-1true, Black: 192#(= ~readerprogress1~0 0), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 223#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 110#qrcu_reader2EXITtrue, 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 182#(= ~readerprogress1~0 0), Black: 214#true, Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 13:02:25,520 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-25 13:02:25,520 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 13:02:25,520 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 13:02:25,521 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 13:02:25,560 INFO L129 PetriNetUnfolder]: 593/1742 cut-off events. [2021-03-25 13:02:25,560 INFO L130 PetriNetUnfolder]: For 2646/2784 co-relation queries the response was YES. [2021-03-25 13:02:25,571 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4431 conditions, 1742 events. 593/1742 cut-off events. For 2646/2784 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 14994 event pairs, 14 based on Foata normal form. 29/1661 useless extension candidates. Maximal degree in co-relation 4012. Up to 247 conditions per place. [2021-03-25 13:02:25,589 INFO L142 LiptonReduction]: Number of co-enabled transitions 4576 [2021-03-25 13:02:25,717 INFO L154 LiptonReduction]: Checked pairs total: 1441 [2021-03-25 13:02:25,717 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 13:02:25,717 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 321 [2021-03-25 13:02:25,718 INFO L480 AbstractCegarLoop]: Abstraction has has 98 places, 139 transitions, 832 flow [2021-03-25 13:02:25,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 206.5) internal successors, (1239), 6 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:25,718 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:25,718 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 13:02:25,719 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 13:02:25,719 INFO L428 AbstractCegarLoop]: === Iteration 8 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:25,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:25,719 INFO L82 PathProgramCache]: Analyzing trace with hash 2050523745, now seen corresponding path program 1 times [2021-03-25 13:02:25,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:25,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562650878] [2021-03-25 13:02:25,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:25,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:25,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 13:02:25,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:25,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:25,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-03-25 13:02:25,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562650878] [2021-03-25 13:02:25,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:25,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 13:02:25,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117068725] [2021-03-25 13:02:25,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 13:02:25,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:25,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 13:02:25,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 13:02:25,761 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 302 [2021-03-25 13:02:25,762 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 139 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 278.6666666666667) internal successors, (836), 3 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:25,762 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:25,762 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 302 [2021-03-25 13:02:25,762 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:25,984 INFO L129 PetriNetUnfolder]: 583/1774 cut-off events. [2021-03-25 13:02:25,984 INFO L130 PetriNetUnfolder]: For 2807/2880 co-relation queries the response was YES. [2021-03-25 13:02:25,996 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4642 conditions, 1774 events. 583/1774 cut-off events. For 2807/2880 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 15313 event pairs, 17 based on Foata normal form. 48/1724 useless extension candidates. Maximal degree in co-relation 4260. Up to 246 conditions per place. [2021-03-25 13:02:26,008 INFO L132 encePairwiseOnDemand]: 300/302 looper letters, 17 selfloop transitions, 1 changer transitions 0/143 dead transitions. [2021-03-25 13:02:26,008 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 143 transitions, 896 flow [2021-03-25 13:02:26,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 13:02:26,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 13:02:26,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 840 transitions. [2021-03-25 13:02:26,011 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9271523178807947 [2021-03-25 13:02:26,011 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 840 transitions. [2021-03-25 13:02:26,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 840 transitions. [2021-03-25 13:02:26,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:26,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 840 transitions. [2021-03-25 13:02:26,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:26,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:26,015 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:26,015 INFO L185 Difference]: Start difference. First operand has 98 places, 139 transitions, 832 flow. Second operand 3 states and 840 transitions. [2021-03-25 13:02:26,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 143 transitions, 896 flow [2021-03-25 13:02:26,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 143 transitions, 881 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-25 13:02:26,031 INFO L241 Difference]: Finished difference. Result has 100 places, 139 transitions, 822 flow [2021-03-25 13:02:26,031 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=822, PETRI_PLACES=100, PETRI_TRANSITIONS=139} [2021-03-25 13:02:26,031 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 22 predicate places. [2021-03-25 13:02:26,031 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:26,032 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 139 transitions, 822 flow [2021-03-25 13:02:26,032 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 139 transitions, 822 flow [2021-03-25 13:02:26,033 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 100 places, 139 transitions, 822 flow [2021-03-25 13:02:26,103 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= v_qrcu_updaterThread1of1ForFork2_~sum~0_127 v_~ctr2~0_313) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_128 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_128, ~ctr2~0=v_~ctr2~0_313} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_127, ~ctr2~0=v_~ctr2~0_313} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][90], [196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 165#true, 39#L725-3true, 135#L767-8true, Black: 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 227#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 229#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 192#(= ~readerprogress1~0 0), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 223#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 236#true, 110#qrcu_reader2EXITtrue, 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 238#(= ~readerprogress1~0 2), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, Black: 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 220#true, Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 13:02:26,104 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-25 13:02:26,104 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 13:02:26,104 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 13:02:26,104 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 13:02:26,186 INFO L129 PetriNetUnfolder]: 613/1829 cut-off events. [2021-03-25 13:02:26,186 INFO L130 PetriNetUnfolder]: For 2698/2837 co-relation queries the response was YES. [2021-03-25 13:02:26,198 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4565 conditions, 1829 events. 613/1829 cut-off events. For 2698/2837 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 16025 event pairs, 15 based on Foata normal form. 30/1753 useless extension candidates. Maximal degree in co-relation 4057. Up to 246 conditions per place. [2021-03-25 13:02:26,219 INFO L142 LiptonReduction]: Number of co-enabled transitions 4558 [2021-03-25 13:02:26,404 INFO L154 LiptonReduction]: Checked pairs total: 1168 [2021-03-25 13:02:26,405 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 13:02:26,405 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 374 [2021-03-25 13:02:26,405 INFO L480 AbstractCegarLoop]: Abstraction has has 100 places, 139 transitions, 822 flow [2021-03-25 13:02:26,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 278.6666666666667) internal successors, (836), 3 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:26,406 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:26,406 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 13:02:26,406 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 13:02:26,406 INFO L428 AbstractCegarLoop]: === Iteration 9 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:26,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:26,406 INFO L82 PathProgramCache]: Analyzing trace with hash 543509044, now seen corresponding path program 1 times [2021-03-25 13:02:26,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:26,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057031056] [2021-03-25 13:02:26,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:26,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:26,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 13:02:26,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:26,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:26,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 13:02:26,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057031056] [2021-03-25 13:02:26,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:26,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 13:02:26,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495384278] [2021-03-25 13:02:26,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 13:02:26,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:26,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 13:02:26,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 13:02:26,452 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 302 [2021-03-25 13:02:26,453 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 139 transitions, 822 flow. Second operand has 3 states, 3 states have (on average 274.6666666666667) internal successors, (824), 3 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:26,453 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:26,453 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 302 [2021-03-25 13:02:26,453 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:26,682 INFO L129 PetriNetUnfolder]: 593/1815 cut-off events. [2021-03-25 13:02:26,682 INFO L130 PetriNetUnfolder]: For 2879/3014 co-relation queries the response was YES. [2021-03-25 13:02:26,692 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4734 conditions, 1815 events. 593/1815 cut-off events. For 2879/3014 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 15724 event pairs, 17 based on Foata normal form. 68/1783 useless extension candidates. Maximal degree in co-relation 4349. Up to 250 conditions per place. [2021-03-25 13:02:26,700 INFO L132 encePairwiseOnDemand]: 300/302 looper letters, 18 selfloop transitions, 1 changer transitions 0/143 dead transitions. [2021-03-25 13:02:26,700 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 143 transitions, 886 flow [2021-03-25 13:02:26,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 13:02:26,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 13:02:26,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2021-03-25 13:02:26,702 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9139072847682119 [2021-03-25 13:02:26,702 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 828 transitions. [2021-03-25 13:02:26,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 828 transitions. [2021-03-25 13:02:26,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:26,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 828 transitions. [2021-03-25 13:02:26,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:26,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:26,707 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:26,707 INFO L185 Difference]: Start difference. First operand has 100 places, 139 transitions, 822 flow. Second operand 3 states and 828 transitions. [2021-03-25 13:02:26,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 143 transitions, 886 flow [2021-03-25 13:02:26,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 143 transitions, 885 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 13:02:26,718 INFO L241 Difference]: Finished difference. Result has 102 places, 139 transitions, 830 flow [2021-03-25 13:02:26,718 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=830, PETRI_PLACES=102, PETRI_TRANSITIONS=139} [2021-03-25 13:02:26,718 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 24 predicate places. [2021-03-25 13:02:26,718 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:26,719 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 139 transitions, 830 flow [2021-03-25 13:02:26,719 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 139 transitions, 830 flow [2021-03-25 13:02:26,720 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 139 transitions, 830 flow [2021-03-25 13:02:26,781 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= v_qrcu_updaterThread1of1ForFork2_~sum~0_127 v_~ctr2~0_313) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_128 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_128, ~ctr2~0=v_~ctr2~0_313} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_127, ~ctr2~0=v_~ctr2~0_313} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][90], [196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 165#true, 39#L725-3true, 135#L767-8true, Black: 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 227#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 229#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 192#(= ~readerprogress1~0 0), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 223#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 110#qrcu_reader2EXITtrue, 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 238#(= ~readerprogress1~0 2), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 243#(= ~readerprogress2~0 2), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, Black: 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 220#true, Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 13:02:26,781 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-25 13:02:26,781 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 13:02:26,782 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 13:02:26,782 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 13:02:26,870 INFO L129 PetriNetUnfolder]: 616/1859 cut-off events. [2021-03-25 13:02:26,871 INFO L130 PetriNetUnfolder]: For 2642/2748 co-relation queries the response was YES. [2021-03-25 13:02:26,883 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4618 conditions, 1859 events. 616/1859 cut-off events. For 2642/2748 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 16359 event pairs, 16 based on Foata normal form. 30/1779 useless extension candidates. Maximal degree in co-relation 4085. Up to 246 conditions per place. [2021-03-25 13:02:26,905 INFO L142 LiptonReduction]: Number of co-enabled transitions 4516 [2021-03-25 13:02:27,085 INFO L154 LiptonReduction]: Checked pairs total: 1168 [2021-03-25 13:02:27,086 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 13:02:27,086 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 368 [2021-03-25 13:02:27,086 INFO L480 AbstractCegarLoop]: Abstraction has has 102 places, 139 transitions, 830 flow [2021-03-25 13:02:27,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 274.6666666666667) internal successors, (824), 3 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:27,087 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:27,087 INFO L263 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] [2021-03-25 13:02:27,087 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 13:02:27,087 INFO L428 AbstractCegarLoop]: === Iteration 10 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:27,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:27,088 INFO L82 PathProgramCache]: Analyzing trace with hash 2047548884, now seen corresponding path program 1 times [2021-03-25 13:02:27,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:27,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080716964] [2021-03-25 13:02:27,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:27,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:27,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:27,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:27,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:27,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:27,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:27,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:27,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 13:02:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 13:02:27,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080716964] [2021-03-25 13:02:27,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:27,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 13:02:27,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338327983] [2021-03-25 13:02:27,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 13:02:27,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:27,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 13:02:27,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 13:02:27,125 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 302 [2021-03-25 13:02:27,126 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 139 transitions, 830 flow. Second operand has 5 states, 5 states have (on average 253.4) internal successors, (1267), 5 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-03-25 13:02:27,126 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:27,126 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 302 [2021-03-25 13:02:27,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:27,579 INFO L129 PetriNetUnfolder]: 1053/2853 cut-off events. [2021-03-25 13:02:27,579 INFO L130 PetriNetUnfolder]: For 5618/5911 co-relation queries the response was YES. [2021-03-25 13:02:27,595 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8163 conditions, 2853 events. 1053/2853 cut-off events. For 5618/5911 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 25865 event pairs, 51 based on Foata normal form. 157/2914 useless extension candidates. Maximal degree in co-relation 7490. Up to 706 conditions per place. [2021-03-25 13:02:27,607 INFO L132 encePairwiseOnDemand]: 291/302 looper letters, 54 selfloop transitions, 30 changer transitions 0/185 dead transitions. [2021-03-25 13:02:27,607 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 185 transitions, 1260 flow [2021-03-25 13:02:27,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 13:02:27,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 13:02:27,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1824 transitions. [2021-03-25 13:02:27,612 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8628192999053926 [2021-03-25 13:02:27,612 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1824 transitions. [2021-03-25 13:02:27,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1824 transitions. [2021-03-25 13:02:27,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:27,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1824 transitions. [2021-03-25 13:02:27,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 260.57142857142856) internal successors, (1824), 7 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:27,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:27,622 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:27,622 INFO L185 Difference]: Start difference. First operand has 102 places, 139 transitions, 830 flow. Second operand 7 states and 1824 transitions. [2021-03-25 13:02:27,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 185 transitions, 1260 flow [2021-03-25 13:02:27,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 185 transitions, 1259 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 13:02:27,637 INFO L241 Difference]: Finished difference. Result has 112 places, 163 transitions, 1117 flow [2021-03-25 13:02:27,637 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1117, PETRI_PLACES=112, PETRI_TRANSITIONS=163} [2021-03-25 13:02:27,638 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 34 predicate places. [2021-03-25 13:02:27,638 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:27,638 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 163 transitions, 1117 flow [2021-03-25 13:02:27,638 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 163 transitions, 1117 flow [2021-03-25 13:02:27,639 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 163 transitions, 1117 flow [2021-03-25 13:02:27,845 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([961] L774-2-->L777: Formula: (and (not (< 0 v_~ctr2~0_416)) (= (select (select |v_#memory_int_185| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_75|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_67|) |v_qrcu_updaterThread1of1ForFork2_#t~mem22_41|) (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#mutex~0.base_36| (store (select |v_#pthreadsMutex_28| |v_~#mutex~0.base_36|) |v_~#mutex~0.offset_36| 0)))) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_75|, #pthreadsMutex=|v_#pthreadsMutex_28|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_67|, ~#mutex~0.base=|v_~#mutex~0.base_36|, #memory_int=|v_#memory_int_185|, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, ~ctr2~0=v_~ctr2~0_416} OutVars{qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_75|, #pthreadsMutex=|v_#pthreadsMutex_27|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_67|, ~#mutex~0.base=|v_~#mutex~0.base_36|, #memory_int=|v_#memory_int_185|, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_41|, ~ctr2~0=v_~ctr2~0_416} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~mem22][76], [Black: 248#(= ~ctr2~0 0), Black: 249#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 250#(<= 1 ~ctr2~0), Black: 254#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 192#(= ~readerprogress1~0 0), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, 95#L738true, 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 165#true, Black: 227#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 229#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 220#true, Black: 223#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 110#qrcu_reader2EXITtrue, Black: 238#(= ~readerprogress1~0 2), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 243#(= ~readerprogress2~0 2), 246#true, Black: 182#(= ~readerprogress1~0 0), Black: 187#(= ~readerprogress2~0 0), 62#L777true]) [2021-03-25 13:02:27,845 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 13:02:27,845 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 13:02:27,845 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-25 13:02:27,845 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-25 13:02:27,855 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([961] L774-2-->L777: Formula: (and (not (< 0 v_~ctr2~0_416)) (= (select (select |v_#memory_int_185| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_75|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_67|) |v_qrcu_updaterThread1of1ForFork2_#t~mem22_41|) (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#mutex~0.base_36| (store (select |v_#pthreadsMutex_28| |v_~#mutex~0.base_36|) |v_~#mutex~0.offset_36| 0)))) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_75|, #pthreadsMutex=|v_#pthreadsMutex_28|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_67|, ~#mutex~0.base=|v_~#mutex~0.base_36|, #memory_int=|v_#memory_int_185|, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, ~ctr2~0=v_~ctr2~0_416} OutVars{qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_75|, #pthreadsMutex=|v_#pthreadsMutex_27|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_67|, ~#mutex~0.base=|v_~#mutex~0.base_36|, #memory_int=|v_#memory_int_185|, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_41|, ~ctr2~0=v_~ctr2~0_416} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~mem22][76], [Black: 248#(= ~ctr2~0 0), Black: 249#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 250#(<= 1 ~ctr2~0), Black: 254#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 192#(= ~readerprogress1~0 0), 204#true, Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), Black: 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, 95#L738true, 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 165#true, Black: 227#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 229#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 220#true, Black: 223#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 110#qrcu_reader2EXITtrue, Black: 238#(= ~readerprogress1~0 2), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 243#(= ~readerprogress2~0 2), 246#true, Black: 182#(= ~readerprogress1~0 0), Black: 187#(= ~readerprogress2~0 0), 62#L777true]) [2021-03-25 13:02:27,855 INFO L384 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2021-03-25 13:02:27,855 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-25 13:02:27,855 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-25 13:02:27,855 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-25 13:02:27,872 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([741] L725-3-->L738: Formula: (= v_~readerprogress1~0_1 1) InVars {} OutVars{~readerprogress1~0=v_~readerprogress1~0_1} AuxVars[] AssignedVars[~readerprogress1~0][120], [Black: 246#true, Black: 248#(= ~ctr2~0 0), Black: 249#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 254#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 192#(= ~readerprogress1~0 0), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 204#true, Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), 20#qrcu_updaterEXITtrue, Black: 206#(= ~readerprogress2~0 0), Black: 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, 95#L738true, 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 165#true, Black: 227#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 229#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 220#true, Black: 223#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 110#qrcu_reader2EXITtrue, Black: 238#(= ~readerprogress1~0 2), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 243#(= ~readerprogress2~0 2), Black: 182#(= ~readerprogress1~0 0), 250#(<= 1 ~ctr2~0), Black: 187#(= ~readerprogress2~0 0), 190#true]) [2021-03-25 13:02:27,872 INFO L384 tUnfolder$Statistics]: this new event has 30 ancestors and is not cut-off event [2021-03-25 13:02:27,872 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2021-03-25 13:02:27,872 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2021-03-25 13:02:27,873 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2021-03-25 13:02:27,890 INFO L129 PetriNetUnfolder]: 979/2833 cut-off events. [2021-03-25 13:02:27,891 INFO L130 PetriNetUnfolder]: For 6013/6234 co-relation queries the response was YES. [2021-03-25 13:02:27,911 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8227 conditions, 2833 events. 979/2833 cut-off events. For 6013/6234 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 27113 event pairs, 36 based on Foata normal form. 48/2769 useless extension candidates. Maximal degree in co-relation 7450. Up to 369 conditions per place. [2021-03-25 13:02:27,946 INFO L142 LiptonReduction]: Number of co-enabled transitions 5324 [2021-03-25 13:02:28,796 INFO L154 LiptonReduction]: Checked pairs total: 2185 [2021-03-25 13:02:28,797 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 13:02:28,797 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1159 [2021-03-25 13:02:28,798 INFO L480 AbstractCegarLoop]: Abstraction has has 112 places, 163 transitions, 1117 flow [2021-03-25 13:02:28,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 253.4) internal successors, (1267), 5 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-03-25 13:02:28,799 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:28,799 INFO L263 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] [2021-03-25 13:02:28,799 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 13:02:28,799 INFO L428 AbstractCegarLoop]: === Iteration 11 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:28,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:28,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1240925071, now seen corresponding path program 1 times [2021-03-25 13:02:28,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:28,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872311644] [2021-03-25 13:02:28,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:28,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:28,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:28,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:28,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 13:02:28,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 13:02:28,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872311644] [2021-03-25 13:02:28,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:28,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 13:02:28,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066540613] [2021-03-25 13:02:28,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 13:02:28,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:28,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 13:02:28,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 13:02:28,825 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 302 [2021-03-25 13:02:28,826 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 163 transitions, 1117 flow. Second operand has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:28,826 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:28,826 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 302 [2021-03-25 13:02:28,826 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:29,080 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([914] L767-10-->L770-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_16| |v_~#mutex~0.base_22|))) (and (= (select .cse0 |v_~#mutex~0.offset_22|) 0) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7| 0) (= (store |v_#pthreadsMutex_16| |v_~#mutex~0.base_22| (store .cse0 |v_~#mutex~0.offset_22| 1)) |v_#pthreadsMutex_15|) (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_51))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_#t~nondet17=|v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~nondet17][105], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 248#(= ~ctr2~0 0), Black: 249#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 250#(<= 1 ~ctr2~0), Black: 254#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 263#(<= ~idx~0 0), Black: 192#(= ~readerprogress1~0 0), 138#L770-1true, Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 100#qrcu_reader1EXITtrue, 165#true, Black: 227#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 229#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 220#true, Black: 223#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 110#qrcu_reader2EXITtrue, 238#(= ~readerprogress1~0 2), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 243#(= ~readerprogress2~0 2), 246#true, Black: 182#(= ~readerprogress1~0 0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 13:02:29,081 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-25 13:02:29,081 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 13:02:29,081 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 13:02:29,081 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 13:02:29,112 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([914] L767-10-->L770-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_16| |v_~#mutex~0.base_22|))) (and (= (select .cse0 |v_~#mutex~0.offset_22|) 0) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7| 0) (= (store |v_#pthreadsMutex_16| |v_~#mutex~0.base_22| (store .cse0 |v_~#mutex~0.offset_22| 1)) |v_#pthreadsMutex_15|) (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_51))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_#t~nondet17=|v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~nondet17][105], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 248#(= ~ctr2~0 0), Black: 249#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 250#(<= 1 ~ctr2~0), Black: 254#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 263#(<= ~idx~0 0), 138#L770-1true, Black: 192#(= ~readerprogress1~0 0), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 100#qrcu_reader1EXITtrue, 165#true, Black: 227#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 229#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 220#true, Black: 223#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 238#(= ~readerprogress1~0 2), 110#qrcu_reader2EXITtrue, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 243#(= ~readerprogress2~0 2), 246#true, Black: 182#(= ~readerprogress1~0 0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 13:02:29,112 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-25 13:02:29,112 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 13:02:29,112 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 13:02:29,112 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 13:02:29,112 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 13:02:29,291 INFO L129 PetriNetUnfolder]: 1427/3929 cut-off events. [2021-03-25 13:02:29,291 INFO L130 PetriNetUnfolder]: For 7116/7327 co-relation queries the response was YES. [2021-03-25 13:02:29,321 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11213 conditions, 3929 events. 1427/3929 cut-off events. For 7116/7327 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 37743 event pairs, 126 based on Foata normal form. 124/3527 useless extension candidates. Maximal degree in co-relation 10276. Up to 408 conditions per place. [2021-03-25 13:02:29,340 INFO L132 encePairwiseOnDemand]: 298/302 looper letters, 20 selfloop transitions, 5 changer transitions 0/161 dead transitions. [2021-03-25 13:02:29,341 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 161 transitions, 1135 flow [2021-03-25 13:02:29,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 13:02:29,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 13:02:29,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 815 transitions. [2021-03-25 13:02:29,343 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8995584988962473 [2021-03-25 13:02:29,343 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 815 transitions. [2021-03-25 13:02:29,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 815 transitions. [2021-03-25 13:02:29,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:29,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 815 transitions. [2021-03-25 13:02:29,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 271.6666666666667) internal successors, (815), 3 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:29,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:29,360 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:29,360 INFO L185 Difference]: Start difference. First operand has 112 places, 163 transitions, 1117 flow. Second operand 3 states and 815 transitions. [2021-03-25 13:02:29,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 161 transitions, 1135 flow [2021-03-25 13:02:29,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 161 transitions, 1097 flow, removed 19 selfloop flow, removed 0 redundant places. [2021-03-25 13:02:29,405 INFO L241 Difference]: Finished difference. Result has 110 places, 153 transitions, 1041 flow [2021-03-25 13:02:29,405 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1041, PETRI_PLACES=110, PETRI_TRANSITIONS=153} [2021-03-25 13:02:29,405 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 32 predicate places. [2021-03-25 13:02:29,405 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:29,405 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 153 transitions, 1041 flow [2021-03-25 13:02:29,405 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 153 transitions, 1041 flow [2021-03-25 13:02:29,406 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 110 places, 153 transitions, 1041 flow [2021-03-25 13:02:29,626 INFO L129 PetriNetUnfolder]: 809/2522 cut-off events. [2021-03-25 13:02:29,627 INFO L130 PetriNetUnfolder]: For 4877/5050 co-relation queries the response was YES. [2021-03-25 13:02:29,644 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7380 conditions, 2522 events. 809/2522 cut-off events. For 4877/5050 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 23898 event pairs, 30 based on Foata normal form. 46/2502 useless extension candidates. Maximal degree in co-relation 6678. Up to 286 conditions per place. [2021-03-25 13:02:29,675 INFO L142 LiptonReduction]: Number of co-enabled transitions 4784 [2021-03-25 13:02:30,372 INFO L154 LiptonReduction]: Checked pairs total: 1706 [2021-03-25 13:02:30,372 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 13:02:30,372 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 967 [2021-03-25 13:02:30,373 INFO L480 AbstractCegarLoop]: Abstraction has has 110 places, 153 transitions, 1041 flow [2021-03-25 13:02:30,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:30,373 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:30,373 INFO L263 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] [2021-03-25 13:02:30,373 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 13:02:30,373 INFO L428 AbstractCegarLoop]: === Iteration 12 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:30,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:30,374 INFO L82 PathProgramCache]: Analyzing trace with hash -378080908, now seen corresponding path program 1 times [2021-03-25 13:02:30,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:30,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201736628] [2021-03-25 13:02:30,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:30,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:30,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 13:02:30,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:30,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 13:02:30,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:30,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 13:02:30,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 13:02:30,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201736628] [2021-03-25 13:02:30,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:30,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 13:02:30,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338829718] [2021-03-25 13:02:30,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 13:02:30,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:30,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 13:02:30,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 13:02:30,398 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 302 [2021-03-25 13:02:30,399 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 153 transitions, 1041 flow. Second operand has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:30,399 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:30,399 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 302 [2021-03-25 13:02:30,399 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:30,631 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([914] L767-10-->L770-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_16| |v_~#mutex~0.base_22|))) (and (= (select .cse0 |v_~#mutex~0.offset_22|) 0) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7| 0) (= (store |v_#pthreadsMutex_16| |v_~#mutex~0.base_22| (store .cse0 |v_~#mutex~0.offset_22| 1)) |v_#pthreadsMutex_15|) (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_51))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_#t~nondet17=|v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~nondet17][105], [Black: 248#(= ~ctr2~0 0), 193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 249#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 250#(<= 1 ~ctr2~0), Black: 254#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 263#(<= ~idx~0 0), 265#true, 138#L770-1true, Black: 192#(= ~readerprogress1~0 0), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 100#qrcu_reader1EXITtrue, 165#true, Black: 227#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 229#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 220#true, Black: 223#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 238#(= ~readerprogress1~0 2), 110#qrcu_reader2EXITtrue, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), 243#(= ~readerprogress2~0 2), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 246#true, Black: 182#(= ~readerprogress1~0 0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 13:02:30,632 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-25 13:02:30,632 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 13:02:30,632 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 13:02:30,632 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 13:02:30,652 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([914] L767-10-->L770-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_16| |v_~#mutex~0.base_22|))) (and (= (select .cse0 |v_~#mutex~0.offset_22|) 0) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7| 0) (= (store |v_#pthreadsMutex_16| |v_~#mutex~0.base_22| (store .cse0 |v_~#mutex~0.offset_22| 1)) |v_#pthreadsMutex_15|) (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_51))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_#t~nondet17=|v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~nondet17][105], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 248#(= ~ctr2~0 0), Black: 249#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 250#(<= 1 ~ctr2~0), Black: 254#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 263#(<= ~idx~0 0), 265#true, 138#L770-1true, Black: 192#(= ~readerprogress1~0 0), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 100#qrcu_reader1EXITtrue, 165#true, Black: 227#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 229#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 220#true, Black: 223#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 110#qrcu_reader2EXITtrue, 238#(= ~readerprogress1~0 2), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 243#(= ~readerprogress2~0 2), 246#true, Black: 182#(= ~readerprogress1~0 0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 13:02:30,653 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-25 13:02:30,653 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 13:02:30,653 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 13:02:30,653 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 13:02:30,653 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 13:02:30,731 INFO L129 PetriNetUnfolder]: 1159/3297 cut-off events. [2021-03-25 13:02:30,732 INFO L130 PetriNetUnfolder]: For 6343/6517 co-relation queries the response was YES. [2021-03-25 13:02:30,750 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9708 conditions, 3297 events. 1159/3297 cut-off events. For 6343/6517 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 31716 event pairs, 78 based on Foata normal form. 140/3069 useless extension candidates. Maximal degree in co-relation 9125. Up to 394 conditions per place. [2021-03-25 13:02:30,760 INFO L132 encePairwiseOnDemand]: 300/302 looper letters, 21 selfloop transitions, 3 changer transitions 0/155 dead transitions. [2021-03-25 13:02:30,760 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 155 transitions, 1076 flow [2021-03-25 13:02:30,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 13:02:30,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 13:02:30,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 814 transitions. [2021-03-25 13:02:30,762 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8984547461368654 [2021-03-25 13:02:30,762 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 814 transitions. [2021-03-25 13:02:30,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 814 transitions. [2021-03-25 13:02:30,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:30,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 814 transitions. [2021-03-25 13:02:30,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:30,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:30,766 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:30,766 INFO L185 Difference]: Start difference. First operand has 110 places, 153 transitions, 1041 flow. Second operand 3 states and 814 transitions. [2021-03-25 13:02:30,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 155 transitions, 1076 flow [2021-03-25 13:02:30,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 155 transitions, 1058 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-25 13:02:30,798 INFO L241 Difference]: Finished difference. Result has 108 places, 147 transitions, 1000 flow [2021-03-25 13:02:30,798 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=994, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1000, PETRI_PLACES=108, PETRI_TRANSITIONS=147} [2021-03-25 13:02:30,798 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 30 predicate places. [2021-03-25 13:02:30,798 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:30,798 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 147 transitions, 1000 flow [2021-03-25 13:02:30,799 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 147 transitions, 1000 flow [2021-03-25 13:02:30,800 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 147 transitions, 1000 flow [2021-03-25 13:02:30,959 INFO L129 PetriNetUnfolder]: 671/2129 cut-off events. [2021-03-25 13:02:30,959 INFO L130 PetriNetUnfolder]: For 4566/4727 co-relation queries the response was YES. [2021-03-25 13:02:30,972 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6484 conditions, 2129 events. 671/2129 cut-off events. For 4566/4727 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 20083 event pairs, 30 based on Foata normal form. 34/2103 useless extension candidates. Maximal degree in co-relation 5895. Up to 275 conditions per place. [2021-03-25 13:02:30,995 INFO L142 LiptonReduction]: Number of co-enabled transitions 4400 [2021-03-25 13:02:31,376 INFO L154 LiptonReduction]: Checked pairs total: 1695 [2021-03-25 13:02:31,376 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 13:02:31,376 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 578 [2021-03-25 13:02:31,376 INFO L480 AbstractCegarLoop]: Abstraction has has 108 places, 147 transitions, 1000 flow [2021-03-25 13:02:31,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:31,377 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:31,377 INFO L263 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] [2021-03-25 13:02:31,377 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 13:02:31,377 INFO L428 AbstractCegarLoop]: === Iteration 13 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:31,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:31,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1461367455, now seen corresponding path program 1 times [2021-03-25 13:02:31,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:31,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779156690] [2021-03-25 13:02:31,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:31,408 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-25 13:02:31,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 13:02:31,414 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-25 13:02:31,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 13:02:31,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:31,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 13:02:31,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:31,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:31,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:31,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 13:02:31,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:31,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 13:02:31,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:31,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:31,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:31,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 13:02:31,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 13:02:31,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779156690] [2021-03-25 13:02:31,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:31,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 13:02:31,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571029209] [2021-03-25 13:02:31,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 13:02:31,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:31,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 13:02:31,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-03-25 13:02:31,460 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 302 [2021-03-25 13:02:31,461 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 147 transitions, 1000 flow. Second operand has 9 states, 9 states have (on average 183.66666666666666) internal successors, (1653), 9 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:31,461 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:31,462 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 302 [2021-03-25 13:02:31,462 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:32,808 INFO L129 PetriNetUnfolder]: 5333/9705 cut-off events. [2021-03-25 13:02:32,808 INFO L130 PetriNetUnfolder]: For 19780/19909 co-relation queries the response was YES. [2021-03-25 13:02:32,833 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30900 conditions, 9705 events. 5333/9705 cut-off events. For 19780/19909 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 79064 event pairs, 442 based on Foata normal form. 173/7477 useless extension candidates. Maximal degree in co-relation 30119. Up to 2104 conditions per place. [2021-03-25 13:02:32,844 INFO L132 encePairwiseOnDemand]: 273/302 looper letters, 150 selfloop transitions, 53 changer transitions 180/405 dead transitions. [2021-03-25 13:02:32,844 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 405 transitions, 3383 flow [2021-03-25 13:02:32,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-25 13:02:32,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-25 13:02:32,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2437 transitions. [2021-03-25 13:02:32,849 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6724613686534217 [2021-03-25 13:02:32,849 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2437 transitions. [2021-03-25 13:02:32,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2437 transitions. [2021-03-25 13:02:32,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:32,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2437 transitions. [2021-03-25 13:02:32,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 203.08333333333334) internal successors, (2437), 12 states have internal predecessors, (2437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:32,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 302.0) internal successors, (3926), 13 states have internal predecessors, (3926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:32,860 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 302.0) internal successors, (3926), 13 states have internal predecessors, (3926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:32,860 INFO L185 Difference]: Start difference. First operand has 108 places, 147 transitions, 1000 flow. Second operand 12 states and 2437 transitions. [2021-03-25 13:02:32,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 405 transitions, 3383 flow [2021-03-25 13:02:33,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 405 transitions, 3378 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 13:02:33,118 INFO L241 Difference]: Finished difference. Result has 128 places, 135 transitions, 1253 flow [2021-03-25 13:02:33,119 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=989, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1253, PETRI_PLACES=128, PETRI_TRANSITIONS=135} [2021-03-25 13:02:33,119 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 50 predicate places. [2021-03-25 13:02:33,119 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:33,119 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 135 transitions, 1253 flow [2021-03-25 13:02:33,119 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 135 transitions, 1253 flow [2021-03-25 13:02:33,120 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 135 transitions, 1253 flow [2021-03-25 13:02:33,221 INFO L129 PetriNetUnfolder]: 315/1149 cut-off events. [2021-03-25 13:02:33,221 INFO L130 PetriNetUnfolder]: For 4881/4992 co-relation queries the response was YES. [2021-03-25 13:02:33,231 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4336 conditions, 1149 events. 315/1149 cut-off events. For 4881/4992 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 9890 event pairs, 15 based on Foata normal form. 16/1097 useless extension candidates. Maximal degree in co-relation 4149. Up to 156 conditions per place. [2021-03-25 13:02:33,247 INFO L142 LiptonReduction]: Number of co-enabled transitions 2780 [2021-03-25 13:02:33,608 INFO L154 LiptonReduction]: Checked pairs total: 2117 [2021-03-25 13:02:33,609 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 13:02:33,609 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 490 [2021-03-25 13:02:33,609 INFO L480 AbstractCegarLoop]: Abstraction has has 121 places, 133 transitions, 1255 flow [2021-03-25 13:02:33,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 183.66666666666666) internal successors, (1653), 9 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:33,610 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:33,610 INFO L263 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] [2021-03-25 13:02:33,610 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 13:02:33,610 INFO L428 AbstractCegarLoop]: === Iteration 14 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:33,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:33,611 INFO L82 PathProgramCache]: Analyzing trace with hash 795900190, now seen corresponding path program 1 times [2021-03-25 13:02:33,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:33,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248832768] [2021-03-25 13:02:33,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:33,642 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-25 13:02:33,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 13:02:33,649 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-25 13:02:33,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 13:02:33,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:33,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 13:02:33,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:33,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 13:02:33,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:33,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:33,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:33,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:33,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:33,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:33,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:33,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 13:02:33,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 13:02:33,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248832768] [2021-03-25 13:02:33,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:33,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 13:02:33,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507680191] [2021-03-25 13:02:33,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 13:02:33,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:33,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 13:02:33,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-03-25 13:02:33,709 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 306 [2021-03-25 13:02:33,710 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 133 transitions, 1255 flow. Second operand has 9 states, 9 states have (on average 183.66666666666666) internal successors, (1653), 9 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:33,710 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:33,710 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 306 [2021-03-25 13:02:33,710 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:34,346 INFO L129 PetriNetUnfolder]: 1269/2570 cut-off events. [2021-03-25 13:02:34,347 INFO L130 PetriNetUnfolder]: For 11628/11676 co-relation queries the response was YES. [2021-03-25 13:02:34,357 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10503 conditions, 2570 events. 1269/2570 cut-off events. For 11628/11676 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 18147 event pairs, 112 based on Foata normal form. 45/2111 useless extension candidates. Maximal degree in co-relation 10371. Up to 839 conditions per place. [2021-03-25 13:02:34,364 INFO L132 encePairwiseOnDemand]: 286/306 looper letters, 140 selfloop transitions, 64 changer transitions 31/255 dead transitions. [2021-03-25 13:02:34,364 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 255 transitions, 2594 flow [2021-03-25 13:02:34,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-25 13:02:34,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-03-25 13:02:34,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2899 transitions. [2021-03-25 13:02:34,370 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6315904139433551 [2021-03-25 13:02:34,370 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2899 transitions. [2021-03-25 13:02:34,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2899 transitions. [2021-03-25 13:02:34,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:34,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2899 transitions. [2021-03-25 13:02:34,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 193.26666666666668) internal successors, (2899), 15 states have internal predecessors, (2899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:34,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 306.0) internal successors, (4896), 16 states have internal predecessors, (4896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:34,382 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 306.0) internal successors, (4896), 16 states have internal predecessors, (4896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:34,382 INFO L185 Difference]: Start difference. First operand has 121 places, 133 transitions, 1255 flow. Second operand 15 states and 2899 transitions. [2021-03-25 13:02:34,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 255 transitions, 2594 flow [2021-03-25 13:02:34,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 255 transitions, 2416 flow, removed 78 selfloop flow, removed 7 redundant places. [2021-03-25 13:02:34,434 INFO L241 Difference]: Finished difference. Result has 133 places, 158 transitions, 1528 flow [2021-03-25 13:02:34,434 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=1103, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1528, PETRI_PLACES=133, PETRI_TRANSITIONS=158} [2021-03-25 13:02:34,435 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 55 predicate places. [2021-03-25 13:02:34,435 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:34,435 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 158 transitions, 1528 flow [2021-03-25 13:02:34,435 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 158 transitions, 1528 flow [2021-03-25 13:02:34,436 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 133 places, 158 transitions, 1528 flow [2021-03-25 13:02:34,545 INFO L129 PetriNetUnfolder]: 288/1071 cut-off events. [2021-03-25 13:02:34,545 INFO L130 PetriNetUnfolder]: For 5317/5468 co-relation queries the response was YES. [2021-03-25 13:02:34,552 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4125 conditions, 1071 events. 288/1071 cut-off events. For 5317/5468 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9111 event pairs, 16 based on Foata normal form. 36/1046 useless extension candidates. Maximal degree in co-relation 3789. Up to 139 conditions per place. [2021-03-25 13:02:34,563 INFO L142 LiptonReduction]: Number of co-enabled transitions 2572 [2021-03-25 13:02:34,713 INFO L154 LiptonReduction]: Checked pairs total: 3826 [2021-03-25 13:02:34,713 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 13:02:34,713 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 278 [2021-03-25 13:02:34,714 INFO L480 AbstractCegarLoop]: Abstraction has has 133 places, 158 transitions, 1529 flow [2021-03-25 13:02:34,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 183.66666666666666) internal successors, (1653), 9 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:34,714 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:34,715 INFO L263 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] [2021-03-25 13:02:34,715 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 13:02:34,715 INFO L428 AbstractCegarLoop]: === Iteration 15 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:34,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:34,715 INFO L82 PathProgramCache]: Analyzing trace with hash -963353976, now seen corresponding path program 1 times [2021-03-25 13:02:34,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:34,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690021539] [2021-03-25 13:02:34,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:34,771 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-25 13:02:34,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 13:02:34,778 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-25 13:02:34,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 13:02:34,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:34,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 13:02:34,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:34,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:34,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:34,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:34,812 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:34,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:34,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:34,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:34,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:34,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 13:02:34,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 13:02:34,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690021539] [2021-03-25 13:02:34,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:34,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 13:02:34,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319765716] [2021-03-25 13:02:34,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 13:02:34,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:34,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 13:02:34,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-03-25 13:02:34,835 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 307 [2021-03-25 13:02:34,836 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 158 transitions, 1529 flow. Second operand has 9 states, 9 states have (on average 183.66666666666666) internal successors, (1653), 9 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:34,836 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:34,836 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 307 [2021-03-25 13:02:34,836 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:35,412 INFO L129 PetriNetUnfolder]: 1113/2357 cut-off events. [2021-03-25 13:02:35,412 INFO L130 PetriNetUnfolder]: For 11455/11509 co-relation queries the response was YES. [2021-03-25 13:02:35,423 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9654 conditions, 2357 events. 1113/2357 cut-off events. For 11455/11509 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 16906 event pairs, 118 based on Foata normal form. 40/1953 useless extension candidates. Maximal degree in co-relation 9320. Up to 656 conditions per place. [2021-03-25 13:02:35,429 INFO L132 encePairwiseOnDemand]: 284/307 looper letters, 141 selfloop transitions, 57 changer transitions 39/257 dead transitions. [2021-03-25 13:02:35,429 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 257 transitions, 2660 flow [2021-03-25 13:02:35,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-25 13:02:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-03-25 13:02:35,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2550 transitions. [2021-03-25 13:02:35,440 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6389376096216487 [2021-03-25 13:02:35,440 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2550 transitions. [2021-03-25 13:02:35,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2550 transitions. [2021-03-25 13:02:35,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:35,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2550 transitions. [2021-03-25 13:02:35,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 196.15384615384616) internal successors, (2550), 13 states have internal predecessors, (2550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:35,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 307.0) internal successors, (4298), 14 states have internal predecessors, (4298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:35,452 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 307.0) internal successors, (4298), 14 states have internal predecessors, (4298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:35,452 INFO L185 Difference]: Start difference. First operand has 133 places, 158 transitions, 1529 flow. Second operand 13 states and 2550 transitions. [2021-03-25 13:02:35,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 257 transitions, 2660 flow [2021-03-25 13:02:35,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 257 transitions, 2581 flow, removed 28 selfloop flow, removed 3 redundant places. [2021-03-25 13:02:35,502 INFO L241 Difference]: Finished difference. Result has 146 places, 156 transitions, 1590 flow [2021-03-25 13:02:35,502 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1590, PETRI_PLACES=146, PETRI_TRANSITIONS=156} [2021-03-25 13:02:35,502 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 68 predicate places. [2021-03-25 13:02:35,502 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:35,503 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 156 transitions, 1590 flow [2021-03-25 13:02:35,503 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 156 transitions, 1590 flow [2021-03-25 13:02:35,505 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 146 places, 156 transitions, 1590 flow [2021-03-25 13:02:35,597 INFO L129 PetriNetUnfolder]: 281/1058 cut-off events. [2021-03-25 13:02:35,597 INFO L130 PetriNetUnfolder]: For 6610/6748 co-relation queries the response was YES. [2021-03-25 13:02:35,604 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4279 conditions, 1058 events. 281/1058 cut-off events. For 6610/6748 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8973 event pairs, 13 based on Foata normal form. 27/1023 useless extension candidates. Maximal degree in co-relation 3984. Up to 130 conditions per place. [2021-03-25 13:02:35,615 INFO L142 LiptonReduction]: Number of co-enabled transitions 2524 [2021-03-25 13:02:35,655 INFO L154 LiptonReduction]: Checked pairs total: 1574 [2021-03-25 13:02:35,655 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 13:02:35,655 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 153 [2021-03-25 13:02:35,656 INFO L480 AbstractCegarLoop]: Abstraction has has 146 places, 156 transitions, 1590 flow [2021-03-25 13:02:35,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 183.66666666666666) internal successors, (1653), 9 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:35,656 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:35,656 INFO L263 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] [2021-03-25 13:02:35,657 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 13:02:35,657 INFO L428 AbstractCegarLoop]: === Iteration 16 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:35,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:35,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1887563812, now seen corresponding path program 1 times [2021-03-25 13:02:35,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:35,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854982536] [2021-03-25 13:02:35,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:35,686 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 13:02:35,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:35,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:35,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:35,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:35,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 13:02:35,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:35,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 13:02:35,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:35,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 13:02:35,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:35,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:35,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:35,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 13:02:35,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 13:02:35,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854982536] [2021-03-25 13:02:35,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:35,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 13:02:35,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480815823] [2021-03-25 13:02:35,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 13:02:35,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:35,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 13:02:35,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-25 13:02:35,733 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 307 [2021-03-25 13:02:35,734 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 156 transitions, 1590 flow. Second operand has 8 states, 8 states have (on average 207.375) internal successors, (1659), 8 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:35,734 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:35,734 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 307 [2021-03-25 13:02:35,735 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:36,316 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2021-03-25 13:02:36,848 INFO L129 PetriNetUnfolder]: 604/1824 cut-off events. [2021-03-25 13:02:36,848 INFO L130 PetriNetUnfolder]: For 12187/12274 co-relation queries the response was YES. [2021-03-25 13:02:36,857 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7616 conditions, 1824 events. 604/1824 cut-off events. For 12187/12274 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 15785 event pairs, 12 based on Foata normal form. 67/1806 useless extension candidates. Maximal degree in co-relation 6955. Up to 260 conditions per place. [2021-03-25 13:02:36,861 INFO L132 encePairwiseOnDemand]: 284/307 looper letters, 81 selfloop transitions, 80 changer transitions 54/263 dead transitions. [2021-03-25 13:02:36,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 263 transitions, 3185 flow [2021-03-25 13:02:36,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-25 13:02:36,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-03-25 13:02:36,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3237 transitions. [2021-03-25 13:02:36,865 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7029315960912053 [2021-03-25 13:02:36,865 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3237 transitions. [2021-03-25 13:02:36,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3237 transitions. [2021-03-25 13:02:36,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:36,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3237 transitions. [2021-03-25 13:02:36,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 215.8) internal successors, (3237), 15 states have internal predecessors, (3237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:36,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 307.0) internal successors, (4912), 16 states have internal predecessors, (4912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:36,878 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 307.0) internal successors, (4912), 16 states have internal predecessors, (4912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:36,878 INFO L185 Difference]: Start difference. First operand has 146 places, 156 transitions, 1590 flow. Second operand 15 states and 3237 transitions. [2021-03-25 13:02:36,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 263 transitions, 3185 flow [2021-03-25 13:02:36,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 263 transitions, 2927 flow, removed 92 selfloop flow, removed 7 redundant places. [2021-03-25 13:02:36,931 INFO L241 Difference]: Finished difference. Result has 161 places, 184 transitions, 2066 flow [2021-03-25 13:02:36,931 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=1431, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2066, PETRI_PLACES=161, PETRI_TRANSITIONS=184} [2021-03-25 13:02:36,931 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 83 predicate places. [2021-03-25 13:02:36,931 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:36,932 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 184 transitions, 2066 flow [2021-03-25 13:02:36,932 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 184 transitions, 2066 flow [2021-03-25 13:02:36,933 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 161 places, 184 transitions, 2066 flow [2021-03-25 13:02:37,028 INFO L129 PetriNetUnfolder]: 277/1040 cut-off events. [2021-03-25 13:02:37,028 INFO L130 PetriNetUnfolder]: For 7581/7652 co-relation queries the response was YES. [2021-03-25 13:02:37,035 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4446 conditions, 1040 events. 277/1040 cut-off events. For 7581/7652 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 8896 event pairs, 3 based on Foata normal form. 24/1012 useless extension candidates. Maximal degree in co-relation 4221. Up to 118 conditions per place. [2021-03-25 13:02:37,046 INFO L142 LiptonReduction]: Number of co-enabled transitions 2664 [2021-03-25 13:02:37,200 INFO L154 LiptonReduction]: Checked pairs total: 5393 [2021-03-25 13:02:37,201 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 13:02:37,201 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 270 [2021-03-25 13:02:37,201 INFO L480 AbstractCegarLoop]: Abstraction has has 161 places, 184 transitions, 2066 flow [2021-03-25 13:02:37,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 207.375) internal successors, (1659), 8 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:37,202 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:37,202 INFO L263 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] [2021-03-25 13:02:37,202 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 13:02:37,203 INFO L428 AbstractCegarLoop]: === Iteration 17 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:37,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:37,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1849833411, now seen corresponding path program 1 times [2021-03-25 13:02:37,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:37,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950307254] [2021-03-25 13:02:37,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:37,259 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-25 13:02:37,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 13:02:37,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:37,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 13:02:37,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:37,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 13:02:37,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:37,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 13:02:37,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:37,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:37,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:37,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:37,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:37,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:37,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:37,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 13:02:37,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 13:02:37,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950307254] [2021-03-25 13:02:37,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:37,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 13:02:37,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274148334] [2021-03-25 13:02:37,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 13:02:37,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:37,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 13:02:37,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-03-25 13:02:37,340 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 308 [2021-03-25 13:02:37,347 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 184 transitions, 2066 flow. Second operand has 9 states, 9 states have (on average 184.66666666666666) internal successors, (1662), 9 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:37,348 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:37,348 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 308 [2021-03-25 13:02:37,348 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:38,288 INFO L129 PetriNetUnfolder]: 1156/2492 cut-off events. [2021-03-25 13:02:38,288 INFO L130 PetriNetUnfolder]: For 16618/16660 co-relation queries the response was YES. [2021-03-25 13:02:38,304 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11248 conditions, 2492 events. 1156/2492 cut-off events. For 16618/16660 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 17847 event pairs, 107 based on Foata normal form. 46/2039 useless extension candidates. Maximal degree in co-relation 10790. Up to 788 conditions per place. [2021-03-25 13:02:38,312 INFO L132 encePairwiseOnDemand]: 286/308 looper letters, 169 selfloop transitions, 69 changer transitions 27/285 dead transitions. [2021-03-25 13:02:38,312 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 285 transitions, 3180 flow [2021-03-25 13:02:38,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-25 13:02:38,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-03-25 13:02:38,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2723 transitions. [2021-03-25 13:02:38,317 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6314935064935064 [2021-03-25 13:02:38,317 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2723 transitions. [2021-03-25 13:02:38,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2723 transitions. [2021-03-25 13:02:38,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:38,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2723 transitions. [2021-03-25 13:02:38,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 194.5) internal successors, (2723), 14 states have internal predecessors, (2723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:38,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 308.0) internal successors, (4620), 15 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:38,330 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 308.0) internal successors, (4620), 15 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:38,330 INFO L185 Difference]: Start difference. First operand has 161 places, 184 transitions, 2066 flow. Second operand 14 states and 2723 transitions. [2021-03-25 13:02:38,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 285 transitions, 3180 flow [2021-03-25 13:02:38,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 285 transitions, 3042 flow, removed 49 selfloop flow, removed 6 redundant places. [2021-03-25 13:02:38,419 INFO L241 Difference]: Finished difference. Result has 175 places, 196 transitions, 2240 flow [2021-03-25 13:02:38,419 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=1912, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2240, PETRI_PLACES=175, PETRI_TRANSITIONS=196} [2021-03-25 13:02:38,420 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 97 predicate places. [2021-03-25 13:02:38,420 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:38,420 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 196 transitions, 2240 flow [2021-03-25 13:02:38,420 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 196 transitions, 2240 flow [2021-03-25 13:02:38,422 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 175 places, 196 transitions, 2240 flow [2021-03-25 13:02:38,537 INFO L129 PetriNetUnfolder]: 268/1049 cut-off events. [2021-03-25 13:02:38,537 INFO L130 PetriNetUnfolder]: For 7071/7164 co-relation queries the response was YES. [2021-03-25 13:02:38,548 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4373 conditions, 1049 events. 268/1049 cut-off events. For 7071/7164 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8783 event pairs, 5 based on Foata normal form. 26/993 useless extension candidates. Maximal degree in co-relation 4240. Up to 141 conditions per place. [2021-03-25 13:02:38,562 INFO L142 LiptonReduction]: Number of co-enabled transitions 2470 [2021-03-25 13:02:38,743 INFO L154 LiptonReduction]: Checked pairs total: 5289 [2021-03-25 13:02:38,743 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 13:02:38,744 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 324 [2021-03-25 13:02:38,744 INFO L480 AbstractCegarLoop]: Abstraction has has 173 places, 194 transitions, 2237 flow [2021-03-25 13:02:38,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 184.66666666666666) internal successors, (1662), 9 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:38,744 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:38,744 INFO L263 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] [2021-03-25 13:02:38,745 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 13:02:38,745 INFO L428 AbstractCegarLoop]: === Iteration 18 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:38,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:38,745 INFO L82 PathProgramCache]: Analyzing trace with hash 164541581, now seen corresponding path program 1 times [2021-03-25 13:02:38,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:38,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838833931] [2021-03-25 13:02:38,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:38,777 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-25 13:02:38,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 13:02:38,785 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-25 13:02:38,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 13:02:38,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:38,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 13:02:38,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:38,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:38,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:38,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:38,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:38,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:38,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:38,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 13:02:38,836 INFO L142 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-03-25 13:02:38,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 13:02:38,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:38,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 13:02:38,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 13:02:38,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838833931] [2021-03-25 13:02:38,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:38,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 13:02:38,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884176585] [2021-03-25 13:02:38,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 13:02:38,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:38,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 13:02:38,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-03-25 13:02:38,841 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 312 [2021-03-25 13:02:38,842 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 194 transitions, 2237 flow. Second operand has 8 states, 8 states have (on average 184.875) internal successors, (1479), 8 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:38,842 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:38,842 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 312 [2021-03-25 13:02:38,842 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:39,419 INFO L129 PetriNetUnfolder]: 964/2068 cut-off events. [2021-03-25 13:02:39,420 INFO L130 PetriNetUnfolder]: For 14881/14920 co-relation queries the response was YES. [2021-03-25 13:02:39,434 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10314 conditions, 2068 events. 964/2068 cut-off events. For 14881/14920 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 13945 event pairs, 127 based on Foata normal form. 33/1667 useless extension candidates. Maximal degree in co-relation 10171. Up to 748 conditions per place. [2021-03-25 13:02:39,441 INFO L132 encePairwiseOnDemand]: 293/312 looper letters, 192 selfloop transitions, 61 changer transitions 14/287 dead transitions. [2021-03-25 13:02:39,442 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 287 transitions, 3481 flow [2021-03-25 13:02:39,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 13:02:39,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 13:02:39,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1969 transitions. [2021-03-25 13:02:39,444 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6310897435897436 [2021-03-25 13:02:39,444 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1969 transitions. [2021-03-25 13:02:39,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1969 transitions. [2021-03-25 13:02:39,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:39,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1969 transitions. [2021-03-25 13:02:39,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 196.9) internal successors, (1969), 10 states have internal predecessors, (1969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:39,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 312.0) internal successors, (3432), 11 states have internal predecessors, (3432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:39,452 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 312.0) internal successors, (3432), 11 states have internal predecessors, (3432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:39,452 INFO L185 Difference]: Start difference. First operand has 173 places, 194 transitions, 2237 flow. Second operand 10 states and 1969 transitions. [2021-03-25 13:02:39,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 287 transitions, 3481 flow [2021-03-25 13:02:39,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 287 transitions, 3275 flow, removed 34 selfloop flow, removed 11 redundant places. [2021-03-25 13:02:39,548 INFO L241 Difference]: Finished difference. Result has 175 places, 212 transitions, 2444 flow [2021-03-25 13:02:39,548 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=1968, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2444, PETRI_PLACES=175, PETRI_TRANSITIONS=212} [2021-03-25 13:02:39,549 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 97 predicate places. [2021-03-25 13:02:39,549 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:39,549 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions, 2444 flow [2021-03-25 13:02:39,549 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 212 transitions, 2444 flow [2021-03-25 13:02:39,551 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 174 places, 212 transitions, 2444 flow [2021-03-25 13:02:39,672 INFO L129 PetriNetUnfolder]: 288/996 cut-off events. [2021-03-25 13:02:39,672 INFO L130 PetriNetUnfolder]: For 7641/7719 co-relation queries the response was YES. [2021-03-25 13:02:39,678 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4560 conditions, 996 events. 288/996 cut-off events. For 7641/7719 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7913 event pairs, 0 based on Foata normal form. 29/929 useless extension candidates. Maximal degree in co-relation 4366. Up to 145 conditions per place. [2021-03-25 13:02:39,685 INFO L142 LiptonReduction]: Number of co-enabled transitions 2554 [2021-03-25 13:02:40,261 INFO L154 LiptonReduction]: Checked pairs total: 7311 [2021-03-25 13:02:40,261 INFO L156 LiptonReduction]: Total number of compositions: 7 [2021-03-25 13:02:40,261 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 712 [2021-03-25 13:02:40,262 INFO L480 AbstractCegarLoop]: Abstraction has has 172 places, 210 transitions, 2445 flow [2021-03-25 13:02:40,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 184.875) internal successors, (1479), 8 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:40,263 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:40,263 INFO L263 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] [2021-03-25 13:02:40,263 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-25 13:02:40,263 INFO L428 AbstractCegarLoop]: === Iteration 19 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:40,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:40,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1121793462, now seen corresponding path program 1 times [2021-03-25 13:02:40,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:40,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511910001] [2021-03-25 13:02:40,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:40,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:40,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:40,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:40,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:40,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:40,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:40,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:40,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:40,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:40,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 13:02:40,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 13:02:40,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511910001] [2021-03-25 13:02:40,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:40,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 13:02:40,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120369181] [2021-03-25 13:02:40,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 13:02:40,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:40,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 13:02:40,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-25 13:02:40,321 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 319 [2021-03-25 13:02:40,322 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 210 transitions, 2445 flow. Second operand has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:40,322 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:40,322 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 319 [2021-03-25 13:02:40,322 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:40,703 INFO L129 PetriNetUnfolder]: 568/1410 cut-off events. [2021-03-25 13:02:40,703 INFO L130 PetriNetUnfolder]: For 10463/10650 co-relation queries the response was YES. [2021-03-25 13:02:40,712 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7141 conditions, 1410 events. 568/1410 cut-off events. For 10463/10650 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10068 event pairs, 42 based on Foata normal form. 64/1219 useless extension candidates. Maximal degree in co-relation 6925. Up to 309 conditions per place. [2021-03-25 13:02:40,716 INFO L132 encePairwiseOnDemand]: 303/319 looper letters, 129 selfloop transitions, 46 changer transitions 20/270 dead transitions. [2021-03-25 13:02:40,716 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 270 transitions, 3354 flow [2021-03-25 13:02:40,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 13:02:40,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 13:02:40,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1438 transitions. [2021-03-25 13:02:40,718 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7513061650992685 [2021-03-25 13:02:40,718 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1438 transitions. [2021-03-25 13:02:40,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1438 transitions. [2021-03-25 13:02:40,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:40,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1438 transitions. [2021-03-25 13:02:40,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 239.66666666666666) internal successors, (1438), 6 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:40,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 319.0) internal successors, (2233), 7 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:40,722 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 319.0) internal successors, (2233), 7 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:40,722 INFO L185 Difference]: Start difference. First operand has 172 places, 210 transitions, 2445 flow. Second operand 6 states and 1438 transitions. [2021-03-25 13:02:40,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 270 transitions, 3354 flow [2021-03-25 13:02:40,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 270 transitions, 3209 flow, removed 16 selfloop flow, removed 7 redundant places. [2021-03-25 13:02:40,769 INFO L241 Difference]: Finished difference. Result has 173 places, 215 transitions, 2525 flow [2021-03-25 13:02:40,769 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=2301, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2525, PETRI_PLACES=173, PETRI_TRANSITIONS=215} [2021-03-25 13:02:40,769 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 95 predicate places. [2021-03-25 13:02:40,769 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:40,769 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 215 transitions, 2525 flow [2021-03-25 13:02:40,770 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 215 transitions, 2525 flow [2021-03-25 13:02:40,771 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 173 places, 215 transitions, 2525 flow [2021-03-25 13:02:40,845 INFO L129 PetriNetUnfolder]: 284/1010 cut-off events. [2021-03-25 13:02:40,845 INFO L130 PetriNetUnfolder]: For 8493/8595 co-relation queries the response was YES. [2021-03-25 13:02:40,850 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4702 conditions, 1010 events. 284/1010 cut-off events. For 8493/8595 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8221 event pairs, 0 based on Foata normal form. 34/943 useless extension candidates. Maximal degree in co-relation 4485. Up to 147 conditions per place. [2021-03-25 13:02:40,857 INFO L142 LiptonReduction]: Number of co-enabled transitions 2454 [2021-03-25 13:02:41,019 INFO L154 LiptonReduction]: Checked pairs total: 4416 [2021-03-25 13:02:41,019 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 13:02:41,019 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 250 [2021-03-25 13:02:41,019 INFO L480 AbstractCegarLoop]: Abstraction has has 172 places, 214 transitions, 2524 flow [2021-03-25 13:02:41,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:41,020 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:41,020 INFO L263 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] [2021-03-25 13:02:41,020 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-25 13:02:41,020 INFO L428 AbstractCegarLoop]: === Iteration 20 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:41,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:41,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1996888538, now seen corresponding path program 1 times [2021-03-25 13:02:41,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:41,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336499287] [2021-03-25 13:02:41,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:41,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:41,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:41,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:41,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:41,050 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:41,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:41,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:41,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:41,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:41,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:41,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:41,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:41,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 13:02:41,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336499287] [2021-03-25 13:02:41,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:41,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 13:02:41,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541433830] [2021-03-25 13:02:41,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 13:02:41,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:41,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 13:02:41,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-25 13:02:41,075 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 321 [2021-03-25 13:02:41,076 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 214 transitions, 2524 flow. Second operand has 7 states, 7 states have (on average 226.71428571428572) internal successors, (1587), 7 states have internal predecessors, (1587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:41,076 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:41,076 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 321 [2021-03-25 13:02:41,076 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:41,409 INFO L129 PetriNetUnfolder]: 602/1473 cut-off events. [2021-03-25 13:02:41,409 INFO L130 PetriNetUnfolder]: For 12390/12611 co-relation queries the response was YES. [2021-03-25 13:02:41,416 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7721 conditions, 1473 events. 602/1473 cut-off events. For 12390/12611 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10487 event pairs, 39 based on Foata normal form. 108/1310 useless extension candidates. Maximal degree in co-relation 7513. Up to 390 conditions per place. [2021-03-25 13:02:41,420 INFO L132 encePairwiseOnDemand]: 303/321 looper letters, 133 selfloop transitions, 46 changer transitions 33/286 dead transitions. [2021-03-25 13:02:41,420 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 286 transitions, 3734 flow [2021-03-25 13:02:41,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 13:02:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 13:02:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1671 transitions. [2021-03-25 13:02:41,421 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7436582109479306 [2021-03-25 13:02:41,422 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1671 transitions. [2021-03-25 13:02:41,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1671 transitions. [2021-03-25 13:02:41,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:41,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1671 transitions. [2021-03-25 13:02:41,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 238.71428571428572) internal successors, (1671), 7 states have internal predecessors, (1671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:41,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:41,426 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:41,426 INFO L185 Difference]: Start difference. First operand has 172 places, 214 transitions, 2524 flow. Second operand 7 states and 1671 transitions. [2021-03-25 13:02:41,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 286 transitions, 3734 flow [2021-03-25 13:02:41,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 286 transitions, 3705 flow, removed 11 selfloop flow, removed 1 redundant places. [2021-03-25 13:02:41,469 INFO L241 Difference]: Finished difference. Result has 181 places, 224 transitions, 2851 flow [2021-03-25 13:02:41,469 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=2505, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2851, PETRI_PLACES=181, PETRI_TRANSITIONS=224} [2021-03-25 13:02:41,469 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 103 predicate places. [2021-03-25 13:02:41,470 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:41,470 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 224 transitions, 2851 flow [2021-03-25 13:02:41,472 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 181 places, 224 transitions, 2851 flow [2021-03-25 13:02:41,473 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 179 places, 224 transitions, 2851 flow [2021-03-25 13:02:41,588 INFO L129 PetriNetUnfolder]: 326/1101 cut-off events. [2021-03-25 13:02:41,588 INFO L130 PetriNetUnfolder]: For 11766/11875 co-relation queries the response was YES. [2021-03-25 13:02:41,597 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5528 conditions, 1101 events. 326/1101 cut-off events. For 11766/11875 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8879 event pairs, 0 based on Foata normal form. 39/1029 useless extension candidates. Maximal degree in co-relation 5336. Up to 166 conditions per place. [2021-03-25 13:02:41,610 INFO L142 LiptonReduction]: Number of co-enabled transitions 2452 [2021-03-25 13:02:41,673 INFO L154 LiptonReduction]: Checked pairs total: 2767 [2021-03-25 13:02:41,673 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 13:02:41,673 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 203 [2021-03-25 13:02:41,673 INFO L480 AbstractCegarLoop]: Abstraction has has 179 places, 224 transitions, 2851 flow [2021-03-25 13:02:41,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 226.71428571428572) internal successors, (1587), 7 states have internal predecessors, (1587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:41,674 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:41,674 INFO L263 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] [2021-03-25 13:02:41,674 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-25 13:02:41,674 INFO L428 AbstractCegarLoop]: === Iteration 21 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:41,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:41,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1204944282, now seen corresponding path program 1 times [2021-03-25 13:02:41,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:41,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068333533] [2021-03-25 13:02:41,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:41,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:41,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:41,700 INFO L142 QuantifierPusher]: treesize reduction 5, result has 37.5 percent of original size [2021-03-25 13:02:41,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:41,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:41,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:41,708 INFO L142 QuantifierPusher]: treesize reduction 4, result has 42.9 percent of original size [2021-03-25 13:02:41,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:41,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 13:02:41,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068333533] [2021-03-25 13:02:41,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:41,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 13:02:41,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920851060] [2021-03-25 13:02:41,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 13:02:41,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:41,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 13:02:41,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 13:02:41,713 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 321 [2021-03-25 13:02:41,714 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 224 transitions, 2851 flow. Second operand has 5 states, 5 states have (on average 262.2) internal successors, (1311), 5 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:41,714 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:41,714 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 321 [2021-03-25 13:02:41,714 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:41,906 INFO L129 PetriNetUnfolder]: 333/1153 cut-off events. [2021-03-25 13:02:41,907 INFO L130 PetriNetUnfolder]: For 13963/14187 co-relation queries the response was YES. [2021-03-25 13:02:41,912 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6095 conditions, 1153 events. 333/1153 cut-off events. For 13963/14187 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9424 event pairs, 4 based on Foata normal form. 123/1172 useless extension candidates. Maximal degree in co-relation 5883. Up to 219 conditions per place. [2021-03-25 13:02:41,915 INFO L132 encePairwiseOnDemand]: 308/321 looper letters, 35 selfloop transitions, 49 changer transitions 17/236 dead transitions. [2021-03-25 13:02:41,915 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 236 transitions, 3273 flow [2021-03-25 13:02:41,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 13:02:41,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 13:02:41,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1339 transitions. [2021-03-25 13:02:41,916 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8342679127725857 [2021-03-25 13:02:41,916 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1339 transitions. [2021-03-25 13:02:41,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1339 transitions. [2021-03-25 13:02:41,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:41,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1339 transitions. [2021-03-25 13:02:41,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 267.8) internal successors, (1339), 5 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:41,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:41,918 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:41,918 INFO L185 Difference]: Start difference. First operand has 179 places, 224 transitions, 2851 flow. Second operand 5 states and 1339 transitions. [2021-03-25 13:02:41,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 236 transitions, 3273 flow [2021-03-25 13:02:41,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 236 transitions, 3230 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-25 13:02:41,956 INFO L241 Difference]: Finished difference. Result has 182 places, 219 transitions, 2900 flow [2021-03-25 13:02:41,956 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=2808, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2900, PETRI_PLACES=182, PETRI_TRANSITIONS=219} [2021-03-25 13:02:41,956 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 104 predicate places. [2021-03-25 13:02:41,956 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:41,957 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 219 transitions, 2900 flow [2021-03-25 13:02:41,957 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 219 transitions, 2900 flow [2021-03-25 13:02:41,958 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 182 places, 219 transitions, 2900 flow [2021-03-25 13:02:42,032 INFO L129 PetriNetUnfolder]: 282/1033 cut-off events. [2021-03-25 13:02:42,033 INFO L130 PetriNetUnfolder]: For 11612/11723 co-relation queries the response was YES. [2021-03-25 13:02:42,038 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5222 conditions, 1033 events. 282/1033 cut-off events. For 11612/11723 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8458 event pairs, 0 based on Foata normal form. 32/967 useless extension candidates. Maximal degree in co-relation 5042. Up to 152 conditions per place. [2021-03-25 13:02:42,047 INFO L142 LiptonReduction]: Number of co-enabled transitions 2390 [2021-03-25 13:02:42,094 INFO L154 LiptonReduction]: Checked pairs total: 3650 [2021-03-25 13:02:42,095 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 13:02:42,095 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 139 [2021-03-25 13:02:42,095 INFO L480 AbstractCegarLoop]: Abstraction has has 182 places, 219 transitions, 2900 flow [2021-03-25 13:02:42,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 262.2) internal successors, (1311), 5 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:42,096 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:42,096 INFO L263 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] [2021-03-25 13:02:42,096 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-25 13:02:42,096 INFO L428 AbstractCegarLoop]: === Iteration 22 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:42,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:42,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1921075846, now seen corresponding path program 1 times [2021-03-25 13:02:42,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:42,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612815882] [2021-03-25 13:02:42,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:42,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:42,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:42,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:42,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:42,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:42,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:42,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:42,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:42,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 13:02:42,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612815882] [2021-03-25 13:02:42,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:42,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 13:02:42,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671547700] [2021-03-25 13:02:42,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 13:02:42,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:42,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 13:02:42,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-25 13:02:42,146 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 321 [2021-03-25 13:02:42,147 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 219 transitions, 2900 flow. Second operand has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:42,147 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:42,147 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 321 [2021-03-25 13:02:42,147 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:42,429 INFO L129 PetriNetUnfolder]: 491/1324 cut-off events. [2021-03-25 13:02:42,429 INFO L130 PetriNetUnfolder]: For 14748/14940 co-relation queries the response was YES. [2021-03-25 13:02:42,436 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7308 conditions, 1324 events. 491/1324 cut-off events. For 14748/14940 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9757 event pairs, 29 based on Foata normal form. 61/1146 useless extension candidates. Maximal degree in co-relation 7090. Up to 301 conditions per place. [2021-03-25 13:02:42,439 INFO L132 encePairwiseOnDemand]: 306/321 looper letters, 105 selfloop transitions, 35 changer transitions 52/266 dead transitions. [2021-03-25 13:02:42,439 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 266 transitions, 3703 flow [2021-03-25 13:02:42,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 13:02:42,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 13:02:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1439 transitions. [2021-03-25 13:02:42,441 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7471443406022845 [2021-03-25 13:02:42,441 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1439 transitions. [2021-03-25 13:02:42,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1439 transitions. [2021-03-25 13:02:42,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:42,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1439 transitions. [2021-03-25 13:02:42,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 239.83333333333334) internal successors, (1439), 6 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:42,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:42,444 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:42,444 INFO L185 Difference]: Start difference. First operand has 182 places, 219 transitions, 2900 flow. Second operand 6 states and 1439 transitions. [2021-03-25 13:02:42,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 266 transitions, 3703 flow [2021-03-25 13:02:42,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 266 transitions, 3599 flow, removed 10 selfloop flow, removed 3 redundant places. [2021-03-25 13:02:42,495 INFO L241 Difference]: Finished difference. Result has 186 places, 194 transitions, 2438 flow [2021-03-25 13:02:42,496 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=2800, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2438, PETRI_PLACES=186, PETRI_TRANSITIONS=194} [2021-03-25 13:02:42,496 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 108 predicate places. [2021-03-25 13:02:42,496 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:42,496 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 194 transitions, 2438 flow [2021-03-25 13:02:42,496 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 194 transitions, 2438 flow [2021-03-25 13:02:42,497 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 185 places, 194 transitions, 2438 flow [2021-03-25 13:02:42,563 INFO L129 PetriNetUnfolder]: 241/886 cut-off events. [2021-03-25 13:02:42,564 INFO L130 PetriNetUnfolder]: For 9423/9507 co-relation queries the response was YES. [2021-03-25 13:02:42,568 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4510 conditions, 886 events. 241/886 cut-off events. For 9423/9507 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6988 event pairs, 5 based on Foata normal form. 26/819 useless extension candidates. Maximal degree in co-relation 4313. Up to 122 conditions per place. [2021-03-25 13:02:42,574 INFO L142 LiptonReduction]: Number of co-enabled transitions 2174 [2021-03-25 13:02:42,603 INFO L154 LiptonReduction]: Checked pairs total: 2607 [2021-03-25 13:02:42,603 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 13:02:42,603 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 107 [2021-03-25 13:02:42,604 INFO L480 AbstractCegarLoop]: Abstraction has has 185 places, 194 transitions, 2438 flow [2021-03-25 13:02:42,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:42,604 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:42,604 INFO L263 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] [2021-03-25 13:02:42,604 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-25 13:02:42,605 INFO L428 AbstractCegarLoop]: === Iteration 23 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:42,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:42,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2025451189, now seen corresponding path program 1 times [2021-03-25 13:02:42,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:42,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117725638] [2021-03-25 13:02:42,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:42,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:42,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:42,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:42,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:42,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:42,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:42,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:42,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:42,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 13:02:42,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117725638] [2021-03-25 13:02:42,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:42,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 13:02:42,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529985475] [2021-03-25 13:02:42,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 13:02:42,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:42,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 13:02:42,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-25 13:02:42,655 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 321 [2021-03-25 13:02:42,655 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 194 transitions, 2438 flow. Second operand has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:42,655 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:42,655 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 321 [2021-03-25 13:02:42,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:42,901 INFO L129 PetriNetUnfolder]: 427/1157 cut-off events. [2021-03-25 13:02:42,901 INFO L130 PetriNetUnfolder]: For 12250/12430 co-relation queries the response was YES. [2021-03-25 13:02:42,907 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6489 conditions, 1157 events. 427/1157 cut-off events. For 12250/12430 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8226 event pairs, 27 based on Foata normal form. 49/1003 useless extension candidates. Maximal degree in co-relation 6222. Up to 284 conditions per place. [2021-03-25 13:02:42,910 INFO L132 encePairwiseOnDemand]: 308/321 looper letters, 105 selfloop transitions, 22 changer transitions 43/244 dead transitions. [2021-03-25 13:02:42,910 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 244 transitions, 3326 flow [2021-03-25 13:02:42,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 13:02:42,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 13:02:42,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1426 transitions. [2021-03-25 13:02:42,911 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7403946002076843 [2021-03-25 13:02:42,911 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1426 transitions. [2021-03-25 13:02:42,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1426 transitions. [2021-03-25 13:02:42,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:42,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1426 transitions. [2021-03-25 13:02:42,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 237.66666666666666) internal successors, (1426), 6 states have internal predecessors, (1426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:42,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:42,914 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:42,914 INFO L185 Difference]: Start difference. First operand has 185 places, 194 transitions, 2438 flow. Second operand 6 states and 1426 transitions. [2021-03-25 13:02:42,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 244 transitions, 3326 flow [2021-03-25 13:02:42,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 244 transitions, 3106 flow, removed 22 selfloop flow, removed 10 redundant places. [2021-03-25 13:02:42,955 INFO L241 Difference]: Finished difference. Result has 183 places, 185 transitions, 2187 flow [2021-03-25 13:02:42,955 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=2266, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2187, PETRI_PLACES=183, PETRI_TRANSITIONS=185} [2021-03-25 13:02:42,955 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 105 predicate places. [2021-03-25 13:02:42,955 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:42,955 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 185 transitions, 2187 flow [2021-03-25 13:02:42,955 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 185 transitions, 2187 flow [2021-03-25 13:02:42,956 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 180 places, 185 transitions, 2187 flow [2021-03-25 13:02:43,014 INFO L129 PetriNetUnfolder]: 215/799 cut-off events. [2021-03-25 13:02:43,014 INFO L130 PetriNetUnfolder]: For 7121/7182 co-relation queries the response was YES. [2021-03-25 13:02:43,018 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3936 conditions, 799 events. 215/799 cut-off events. For 7121/7182 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6103 event pairs, 3 based on Foata normal form. 17/732 useless extension candidates. Maximal degree in co-relation 3779. Up to 113 conditions per place. [2021-03-25 13:02:43,023 INFO L142 LiptonReduction]: Number of co-enabled transitions 2040 [2021-03-25 13:02:43,044 INFO L154 LiptonReduction]: Checked pairs total: 1878 [2021-03-25 13:02:43,045 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 13:02:43,045 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 90 [2021-03-25 13:02:43,045 INFO L480 AbstractCegarLoop]: Abstraction has has 180 places, 185 transitions, 2187 flow [2021-03-25 13:02:43,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:43,045 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:43,046 INFO L263 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] [2021-03-25 13:02:43,046 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-03-25 13:02:43,046 INFO L428 AbstractCegarLoop]: === Iteration 24 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:43,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:43,046 INFO L82 PathProgramCache]: Analyzing trace with hash 579997045, now seen corresponding path program 1 times [2021-03-25 13:02:43,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:43,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066883804] [2021-03-25 13:02:43,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:43,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:43,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:43,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:43,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:43,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:43,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:43,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:43,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:43,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:43,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:43,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 13:02:43,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066883804] [2021-03-25 13:02:43,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:43,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 13:02:43,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350071776] [2021-03-25 13:02:43,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 13:02:43,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:43,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 13:02:43,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-25 13:02:43,096 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 321 [2021-03-25 13:02:43,097 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 185 transitions, 2187 flow. Second operand has 7 states, 7 states have (on average 225.0) internal successors, (1575), 7 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:43,097 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:43,097 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 321 [2021-03-25 13:02:43,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:43,358 INFO L129 PetriNetUnfolder]: 431/1131 cut-off events. [2021-03-25 13:02:43,358 INFO L130 PetriNetUnfolder]: For 10678/10753 co-relation queries the response was YES. [2021-03-25 13:02:43,364 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6220 conditions, 1131 events. 431/1131 cut-off events. For 10678/10753 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7597 event pairs, 22 based on Foata normal form. 32/968 useless extension candidates. Maximal degree in co-relation 6043. Up to 300 conditions per place. [2021-03-25 13:02:43,366 INFO L132 encePairwiseOnDemand]: 309/321 looper letters, 83 selfloop transitions, 31 changer transitions 84/257 dead transitions. [2021-03-25 13:02:43,366 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 257 transitions, 3274 flow [2021-03-25 13:02:43,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 13:02:43,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 13:02:43,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2336 transitions. [2021-03-25 13:02:43,368 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7277258566978193 [2021-03-25 13:02:43,368 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2336 transitions. [2021-03-25 13:02:43,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2336 transitions. [2021-03-25 13:02:43,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:43,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2336 transitions. [2021-03-25 13:02:43,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 233.6) internal successors, (2336), 10 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:43,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 321.0) internal successors, (3531), 11 states have internal predecessors, (3531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:43,372 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 321.0) internal successors, (3531), 11 states have internal predecessors, (3531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:43,372 INFO L185 Difference]: Start difference. First operand has 180 places, 185 transitions, 2187 flow. Second operand 10 states and 2336 transitions. [2021-03-25 13:02:43,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 257 transitions, 3274 flow [2021-03-25 13:02:43,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 257 transitions, 3136 flow, removed 44 selfloop flow, removed 7 redundant places. [2021-03-25 13:02:43,409 INFO L241 Difference]: Finished difference. Result has 186 places, 146 transitions, 1682 flow [2021-03-25 13:02:43,409 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=2105, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1682, PETRI_PLACES=186, PETRI_TRANSITIONS=146} [2021-03-25 13:02:43,409 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 108 predicate places. [2021-03-25 13:02:43,409 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:43,410 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 146 transitions, 1682 flow [2021-03-25 13:02:43,410 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 146 transitions, 1682 flow [2021-03-25 13:02:43,410 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 181 places, 146 transitions, 1682 flow [2021-03-25 13:02:43,453 INFO L129 PetriNetUnfolder]: 149/613 cut-off events. [2021-03-25 13:02:43,453 INFO L130 PetriNetUnfolder]: For 5173/5195 co-relation queries the response was YES. [2021-03-25 13:02:43,456 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3003 conditions, 613 events. 149/613 cut-off events. For 5173/5195 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4394 event pairs, 0 based on Foata normal form. 6/559 useless extension candidates. Maximal degree in co-relation 2836. Up to 90 conditions per place. [2021-03-25 13:02:43,460 INFO L142 LiptonReduction]: Number of co-enabled transitions 1578 [2021-03-25 13:02:43,475 INFO L154 LiptonReduction]: Checked pairs total: 1144 [2021-03-25 13:02:43,475 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 13:02:43,475 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 66 [2021-03-25 13:02:43,475 INFO L480 AbstractCegarLoop]: Abstraction has has 181 places, 146 transitions, 1682 flow [2021-03-25 13:02:43,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 225.0) internal successors, (1575), 7 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:43,476 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:43,476 INFO L263 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] [2021-03-25 13:02:43,476 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-03-25 13:02:43,476 INFO L428 AbstractCegarLoop]: === Iteration 25 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:43,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:43,476 INFO L82 PathProgramCache]: Analyzing trace with hash 2049076439, now seen corresponding path program 1 times [2021-03-25 13:02:43,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:43,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668824270] [2021-03-25 13:02:43,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:43,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:43,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:43,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:43,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:43,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:43,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:43,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:43,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:43,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:43,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:43,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 13:02:43,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668824270] [2021-03-25 13:02:43,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:43,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 13:02:43,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071869584] [2021-03-25 13:02:43,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 13:02:43,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:43,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 13:02:43,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 13:02:43,538 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 321 [2021-03-25 13:02:43,539 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 146 transitions, 1682 flow. Second operand has 7 states, 7 states have (on average 225.0) internal successors, (1575), 7 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:43,539 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:43,539 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 321 [2021-03-25 13:02:43,539 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:43,770 INFO L129 PetriNetUnfolder]: 355/905 cut-off events. [2021-03-25 13:02:43,770 INFO L130 PetriNetUnfolder]: For 7877/7914 co-relation queries the response was YES. [2021-03-25 13:02:43,774 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5056 conditions, 905 events. 355/905 cut-off events. For 7877/7914 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5606 event pairs, 21 based on Foata normal form. 22/771 useless extension candidates. Maximal degree in co-relation 4813. Up to 201 conditions per place. [2021-03-25 13:02:43,776 INFO L132 encePairwiseOnDemand]: 311/321 looper letters, 72 selfloop transitions, 23 changer transitions 55/207 dead transitions. [2021-03-25 13:02:43,776 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 207 transitions, 2588 flow [2021-03-25 13:02:43,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 13:02:43,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 13:02:43,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2094 transitions. [2021-03-25 13:02:43,778 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7248182762201454 [2021-03-25 13:02:43,778 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2094 transitions. [2021-03-25 13:02:43,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2094 transitions. [2021-03-25 13:02:43,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:43,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2094 transitions. [2021-03-25 13:02:43,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 232.66666666666666) internal successors, (2094), 9 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:43,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 321.0) internal successors, (3210), 10 states have internal predecessors, (3210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:43,782 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 321.0) internal successors, (3210), 10 states have internal predecessors, (3210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:43,782 INFO L185 Difference]: Start difference. First operand has 181 places, 146 transitions, 1682 flow. Second operand 9 states and 2094 transitions. [2021-03-25 13:02:43,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 207 transitions, 2588 flow [2021-03-25 13:02:43,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 207 transitions, 2319 flow, removed 38 selfloop flow, removed 25 redundant places. [2021-03-25 13:02:43,806 INFO L241 Difference]: Finished difference. Result has 166 places, 131 transitions, 1362 flow [2021-03-25 13:02:43,807 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=1467, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1362, PETRI_PLACES=166, PETRI_TRANSITIONS=131} [2021-03-25 13:02:43,807 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 88 predicate places. [2021-03-25 13:02:43,807 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:43,807 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 131 transitions, 1362 flow [2021-03-25 13:02:43,807 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 131 transitions, 1362 flow [2021-03-25 13:02:43,808 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 163 places, 131 transitions, 1362 flow [2021-03-25 13:02:43,849 INFO L129 PetriNetUnfolder]: 94/418 cut-off events. [2021-03-25 13:02:43,849 INFO L130 PetriNetUnfolder]: For 2846/2864 co-relation queries the response was YES. [2021-03-25 13:02:43,850 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1960 conditions, 418 events. 94/418 cut-off events. For 2846/2864 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2718 event pairs, 2 based on Foata normal form. 8/379 useless extension candidates. Maximal degree in co-relation 1888. Up to 69 conditions per place. [2021-03-25 13:02:43,853 INFO L142 LiptonReduction]: Number of co-enabled transitions 1266 [2021-03-25 13:02:43,861 INFO L154 LiptonReduction]: Checked pairs total: 705 [2021-03-25 13:02:43,861 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 13:02:43,861 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 54 [2021-03-25 13:02:43,862 INFO L480 AbstractCegarLoop]: Abstraction has has 163 places, 131 transitions, 1362 flow [2021-03-25 13:02:43,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 225.0) internal successors, (1575), 7 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:43,862 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:43,862 INFO L263 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] [2021-03-25 13:02:43,862 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-03-25 13:02:43,862 INFO L428 AbstractCegarLoop]: === Iteration 26 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:43,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:43,863 INFO L82 PathProgramCache]: Analyzing trace with hash -894094602, now seen corresponding path program 1 times [2021-03-25 13:02:43,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:43,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084039772] [2021-03-25 13:02:43,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:43,886 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 13:02:43,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:43,890 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 13:02:43,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:43,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:43,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:43,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:43,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:43,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:43,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:43,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:43,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:43,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:43,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 13:02:43,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:43,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:43,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:43,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:43,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:43,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:43,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 13:02:43,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084039772] [2021-03-25 13:02:43,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:43,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 13:02:43,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047759636] [2021-03-25 13:02:43,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 13:02:43,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:43,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 13:02:43,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-03-25 13:02:43,952 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 321 [2021-03-25 13:02:43,953 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 131 transitions, 1362 flow. Second operand has 12 states, 12 states have (on average 183.58333333333334) internal successors, (2203), 12 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:43,953 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:43,953 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 321 [2021-03-25 13:02:43,953 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:44,583 INFO L129 PetriNetUnfolder]: 377/885 cut-off events. [2021-03-25 13:02:44,583 INFO L130 PetriNetUnfolder]: For 7373/7396 co-relation queries the response was YES. [2021-03-25 13:02:44,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4948 conditions, 885 events. 377/885 cut-off events. For 7373/7396 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5064 event pairs, 35 based on Foata normal form. 11/723 useless extension candidates. Maximal degree in co-relation 4873. Up to 176 conditions per place. [2021-03-25 13:02:44,590 INFO L132 encePairwiseOnDemand]: 301/321 looper letters, 95 selfloop transitions, 71 changer transitions 77/259 dead transitions. [2021-03-25 13:02:44,590 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 259 transitions, 3021 flow [2021-03-25 13:02:44,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-03-25 13:02:44,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-03-25 13:02:44,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4903 transitions. [2021-03-25 13:02:44,594 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5874670500838726 [2021-03-25 13:02:44,594 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 4903 transitions. [2021-03-25 13:02:44,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 4903 transitions. [2021-03-25 13:02:44,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:44,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4903 transitions. [2021-03-25 13:02:44,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 188.57692307692307) internal successors, (4903), 26 states have internal predecessors, (4903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:44,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 321.0) internal successors, (8667), 27 states have internal predecessors, (8667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:44,605 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 321.0) internal successors, (8667), 27 states have internal predecessors, (8667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:44,606 INFO L185 Difference]: Start difference. First operand has 163 places, 131 transitions, 1362 flow. Second operand 26 states and 4903 transitions. [2021-03-25 13:02:44,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 259 transitions, 3021 flow [2021-03-25 13:02:44,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 259 transitions, 2704 flow, removed 99 selfloop flow, removed 16 redundant places. [2021-03-25 13:02:44,633 INFO L241 Difference]: Finished difference. Result has 178 places, 133 transitions, 1399 flow [2021-03-25 13:02:44,633 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1399, PETRI_PLACES=178, PETRI_TRANSITIONS=133} [2021-03-25 13:02:44,633 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 100 predicate places. [2021-03-25 13:02:44,633 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:44,634 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 133 transitions, 1399 flow [2021-03-25 13:02:44,634 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 133 transitions, 1399 flow [2021-03-25 13:02:44,635 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 166 places, 133 transitions, 1399 flow [2021-03-25 13:02:44,664 INFO L129 PetriNetUnfolder]: 95/325 cut-off events. [2021-03-25 13:02:44,665 INFO L130 PetriNetUnfolder]: For 2179/2208 co-relation queries the response was YES. [2021-03-25 13:02:44,666 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1566 conditions, 325 events. 95/325 cut-off events. For 2179/2208 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1625 event pairs, 2 based on Foata normal form. 3/291 useless extension candidates. Maximal degree in co-relation 1497. Up to 59 conditions per place. [2021-03-25 13:02:44,669 INFO L142 LiptonReduction]: Number of co-enabled transitions 1040 [2021-03-25 13:02:45,008 INFO L154 LiptonReduction]: Checked pairs total: 1845 [2021-03-25 13:02:45,008 INFO L156 LiptonReduction]: Total number of compositions: 8 [2021-03-25 13:02:45,008 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 375 [2021-03-25 13:02:45,009 INFO L480 AbstractCegarLoop]: Abstraction has has 161 places, 129 transitions, 1398 flow [2021-03-25 13:02:45,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 183.58333333333334) internal successors, (2203), 12 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:45,009 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:45,009 INFO L263 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] [2021-03-25 13:02:45,009 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-03-25 13:02:45,009 INFO L428 AbstractCegarLoop]: === Iteration 27 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:45,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:45,010 INFO L82 PathProgramCache]: Analyzing trace with hash -381193822, now seen corresponding path program 2 times [2021-03-25 13:02:45,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:45,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144680968] [2021-03-25 13:02:45,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:45,054 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 13:02:45,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:45,060 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 13:02:45,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:45,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:45,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:45,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:45,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:45,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:45,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:45,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:45,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:45,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:45,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 13:02:45,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:45,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:45,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:45,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:45,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:45,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:45,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 13:02:45,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144680968] [2021-03-25 13:02:45,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:45,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 13:02:45,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357613751] [2021-03-25 13:02:45,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 13:02:45,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:45,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 13:02:45,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-03-25 13:02:45,117 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 329 [2021-03-25 13:02:45,118 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 129 transitions, 1398 flow. Second operand has 12 states, 12 states have (on average 183.58333333333334) internal successors, (2203), 12 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:45,118 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:45,118 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 329 [2021-03-25 13:02:45,118 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:45,639 INFO L129 PetriNetUnfolder]: 281/659 cut-off events. [2021-03-25 13:02:45,639 INFO L130 PetriNetUnfolder]: For 3989/4017 co-relation queries the response was YES. [2021-03-25 13:02:45,643 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3496 conditions, 659 events. 281/659 cut-off events. For 3989/4017 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3369 event pairs, 23 based on Foata normal form. 19/562 useless extension candidates. Maximal degree in co-relation 3304. Up to 133 conditions per place. [2021-03-25 13:02:45,644 INFO L132 encePairwiseOnDemand]: 304/329 looper letters, 44 selfloop transitions, 46 changer transitions 116/221 dead transitions. [2021-03-25 13:02:45,645 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 221 transitions, 2705 flow [2021-03-25 13:02:45,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-03-25 13:02:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2021-03-25 13:02:45,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 5066 transitions. [2021-03-25 13:02:45,650 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5703028256219745 [2021-03-25 13:02:45,650 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 5066 transitions. [2021-03-25 13:02:45,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 5066 transitions. [2021-03-25 13:02:45,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:45,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 5066 transitions. [2021-03-25 13:02:45,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 187.62962962962962) internal successors, (5066), 27 states have internal predecessors, (5066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:45,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 329.0) internal successors, (9212), 28 states have internal predecessors, (9212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:45,661 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 329.0) internal successors, (9212), 28 states have internal predecessors, (9212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:45,661 INFO L185 Difference]: Start difference. First operand has 161 places, 129 transitions, 1398 flow. Second operand 27 states and 5066 transitions. [2021-03-25 13:02:45,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 221 transitions, 2705 flow [2021-03-25 13:02:45,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 221 transitions, 2242 flow, removed 95 selfloop flow, removed 33 redundant places. [2021-03-25 13:02:45,681 INFO L241 Difference]: Finished difference. Result has 156 places, 79 transitions, 709 flow [2021-03-25 13:02:45,681 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=709, PETRI_PLACES=156, PETRI_TRANSITIONS=79} [2021-03-25 13:02:45,681 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 78 predicate places. [2021-03-25 13:02:45,681 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:45,681 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 79 transitions, 709 flow [2021-03-25 13:02:45,682 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 79 transitions, 709 flow [2021-03-25 13:02:45,682 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 79 transitions, 709 flow [2021-03-25 13:02:45,691 INFO L129 PetriNetUnfolder]: 43/146 cut-off events. [2021-03-25 13:02:45,691 INFO L130 PetriNetUnfolder]: For 708/715 co-relation queries the response was YES. [2021-03-25 13:02:45,691 INFO L84 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 146 events. 43/146 cut-off events. For 708/715 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 452 event pairs, 0 based on Foata normal form. 1/132 useless extension candidates. Maximal degree in co-relation 615. Up to 26 conditions per place. [2021-03-25 13:02:45,692 INFO L142 LiptonReduction]: Number of co-enabled transitions 444 [2021-03-25 13:02:47,075 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2021-03-25 13:02:47,260 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2021-03-25 13:02:47,772 INFO L154 LiptonReduction]: Checked pairs total: 613 [2021-03-25 13:02:47,772 INFO L156 LiptonReduction]: Total number of compositions: 23 [2021-03-25 13:02:47,772 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2091 [2021-03-25 13:02:47,773 INFO L480 AbstractCegarLoop]: Abstraction has has 122 places, 74 transitions, 753 flow [2021-03-25 13:02:47,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 183.58333333333334) internal successors, (2203), 12 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:47,773 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 13:02:47,773 INFO L263 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] [2021-03-25 13:02:47,773 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-03-25 13:02:47,773 INFO L428 AbstractCegarLoop]: === Iteration 28 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 13:02:47,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 13:02:47,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1146443423, now seen corresponding path program 1 times [2021-03-25 13:02:47,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 13:02:47,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660192303] [2021-03-25 13:02:47,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 13:02:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 13:02:47,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:47,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:47,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:47,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:47,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:47,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 13:02:47,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 13:02:47,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 13:02:47,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 13:02:47,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660192303] [2021-03-25 13:02:47,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 13:02:47,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 13:02:47,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864251314] [2021-03-25 13:02:47,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 13:02:47,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 13:02:47,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 13:02:47,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-25 13:02:47,821 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 352 [2021-03-25 13:02:47,822 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 74 transitions, 753 flow. Second operand has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:47,822 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 13:02:47,822 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 352 [2021-03-25 13:02:47,822 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 13:02:47,922 INFO L129 PetriNetUnfolder]: 70/164 cut-off events. [2021-03-25 13:02:47,922 INFO L130 PetriNetUnfolder]: For 1183/1199 co-relation queries the response was YES. [2021-03-25 13:02:47,923 INFO L84 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 164 events. 70/164 cut-off events. For 1183/1199 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 523 event pairs, 1 based on Foata normal form. 4/144 useless extension candidates. Maximal degree in co-relation 949. Up to 56 conditions per place. [2021-03-25 13:02:47,923 INFO L132 encePairwiseOnDemand]: 338/352 looper letters, 0 selfloop transitions, 0 changer transitions 82/82 dead transitions. [2021-03-25 13:02:47,923 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 82 transitions, 957 flow [2021-03-25 13:02:47,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 13:02:47,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 13:02:47,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1409 transitions. [2021-03-25 13:02:47,925 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6671401515151515 [2021-03-25 13:02:47,925 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1409 transitions. [2021-03-25 13:02:47,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1409 transitions. [2021-03-25 13:02:47,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 13:02:47,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1409 transitions. [2021-03-25 13:02:47,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 234.83333333333334) internal successors, (1409), 6 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:47,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 352.0) internal successors, (2464), 7 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:47,927 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 352.0) internal successors, (2464), 7 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:47,927 INFO L185 Difference]: Start difference. First operand has 122 places, 74 transitions, 753 flow. Second operand 6 states and 1409 transitions. [2021-03-25 13:02:47,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 82 transitions, 957 flow [2021-03-25 13:02:47,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 82 transitions, 661 flow, removed 23 selfloop flow, removed 44 redundant places. [2021-03-25 13:02:47,931 INFO L241 Difference]: Finished difference. Result has 82 places, 0 transitions, 0 flow [2021-03-25 13:02:47,931 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=82, PETRI_TRANSITIONS=0} [2021-03-25 13:02:47,931 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 4 predicate places. [2021-03-25 13:02:47,931 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 13:02:47,931 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 0 transitions, 0 flow [2021-03-25 13:02:47,931 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 0 transitions, 0 flow [2021-03-25 13:02:47,932 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2021-03-25 13:02:47,932 INFO L129 PetriNetUnfolder]: 0/0 cut-off events. [2021-03-25 13:02:47,932 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 13:02:47,932 INFO L84 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2021-03-25 13:02:47,932 INFO L142 LiptonReduction]: Number of co-enabled transitions 0 [2021-03-25 13:02:47,932 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 13:02:47,932 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 13:02:47,932 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1 [2021-03-25 13:02:47,932 INFO L480 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2021-03-25 13:02:47,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 13:02:47,933 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-03-25 13:02:47,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 01:02:47 BasicIcfg [2021-03-25 13:02:47,936 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 13:02:47,936 INFO L168 Benchmark]: Toolchain (without parser) took 37222.79 ms. Allocated memory was 308.3 MB in the beginning and 1.3 GB in the end (delta: 975.2 MB). Free memory was 271.3 MB in the beginning and 898.4 MB in the end (delta: -627.1 MB). Peak memory consumption was 350.0 MB. Max. memory is 16.0 GB. [2021-03-25 13:02:47,936 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 308.3 MB. Free memory was 289.3 MB in the beginning and 289.3 MB in the end (delta: 71.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 13:02:47,937 INFO L168 Benchmark]: CACSL2BoogieTranslator took 762.43 ms. Allocated memory is still 308.3 MB. Free memory was 271.1 MB in the beginning and 267.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.0 GB. [2021-03-25 13:02:47,937 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.84 ms. Allocated memory is still 308.3 MB. Free memory was 267.9 MB in the beginning and 265.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 13:02:47,937 INFO L168 Benchmark]: Boogie Preprocessor took 50.56 ms. Allocated memory is still 308.3 MB. Free memory was 265.8 MB in the beginning and 263.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 13:02:47,937 INFO L168 Benchmark]: RCFGBuilder took 1132.56 ms. Allocated memory is still 308.3 MB. Free memory was 263.7 MB in the beginning and 163.1 MB in the end (delta: 100.7 MB). Peak memory consumption was 100.7 MB. Max. memory is 16.0 GB. [2021-03-25 13:02:47,937 INFO L168 Benchmark]: TraceAbstraction took 35172.17 ms. Allocated memory was 308.3 MB in the beginning and 1.3 GB in the end (delta: 975.2 MB). Free memory was 162.0 MB in the beginning and 898.4 MB in the end (delta: -736.4 MB). Peak memory consumption was 239.8 MB. Max. memory is 16.0 GB. [2021-03-25 13:02:47,938 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 308.3 MB. Free memory was 289.3 MB in the beginning and 289.3 MB in the end (delta: 71.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 762.43 ms. Allocated memory is still 308.3 MB. Free memory was 271.1 MB in the beginning and 267.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 83.84 ms. Allocated memory is still 308.3 MB. Free memory was 267.9 MB in the beginning and 265.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 50.56 ms. Allocated memory is still 308.3 MB. Free memory was 265.8 MB in the beginning and 263.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1132.56 ms. Allocated memory is still 308.3 MB. Free memory was 263.7 MB in the beginning and 163.1 MB in the end (delta: 100.7 MB). Peak memory consumption was 100.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 35172.17 ms. Allocated memory was 308.3 MB in the beginning and 1.3 GB in the end (delta: 975.2 MB). Free memory was 162.0 MB in the beginning and 898.4 MB in the end (delta: -736.4 MB). Peak memory consumption was 239.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5230.7ms, 147 PlacesBefore, 78 PlacesAfterwards, 159 TransitionsBefore, 86 TransitionsAfterwards, 10120 CoEnabledTransitionPairs, 6 FixpointIterations, 20 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 4 ChoiceCompositions, 85 TotalNumberOfCompositions, 12308 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6289, positive: 6127, positive conditional: 0, positive unconditional: 6127, negative: 162, negative conditional: 0, negative unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4629, positive: 4545, positive conditional: 0, positive unconditional: 4545, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4629, positive: 4545, positive conditional: 0, positive unconditional: 4545, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4629, positive: 4535, positive conditional: 0, positive unconditional: 4535, negative: 94, negative conditional: 0, negative unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 94, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 755, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 695, negative conditional: 0, negative unconditional: 695, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6289, positive: 1582, positive conditional: 0, positive unconditional: 1582, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 4629, unknown conditional: 0, unknown unconditional: 4629] , Statistics on independence cache: Total cache size (in pairs): 730, Positive cache size: 706, Positive conditional cache size: 0, Positive unconditional cache size: 706, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1744.7ms, 82 PlacesBefore, 73 PlacesAfterwards, 104 TransitionsBefore, 95 TransitionsAfterwards, 4322 CoEnabledTransitionPairs, 5 FixpointIterations, 3 TrivialSequentialCompositions, 13 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 20 TotalNumberOfCompositions, 8618 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2060, positive: 1889, positive conditional: 0, positive unconditional: 1889, negative: 171, negative conditional: 0, negative unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 676, positive: 643, positive conditional: 0, positive unconditional: 643, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 676, positive: 643, positive conditional: 0, positive unconditional: 643, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 676, positive: 637, positive conditional: 0, positive unconditional: 637, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 39, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 235, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 210, negative conditional: 0, negative unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2060, positive: 1246, positive conditional: 0, positive unconditional: 1246, negative: 138, negative conditional: 0, negative unconditional: 138, unknown: 676, unknown conditional: 0, unknown unconditional: 676] , Statistics on independence cache: Total cache size (in pairs): 981, Positive cache size: 940, Positive conditional cache size: 0, Positive unconditional cache size: 940, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1959.9ms, 76 PlacesBefore, 70 PlacesAfterwards, 95 TransitionsBefore, 89 TransitionsAfterwards, 3716 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 16 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 17 TotalNumberOfCompositions, 4646 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1564, positive: 1472, positive conditional: 0, positive unconditional: 1472, negative: 92, negative conditional: 0, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 303, positive: 285, positive conditional: 0, positive unconditional: 285, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 303, positive: 285, positive conditional: 0, positive unconditional: 285, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 303, positive: 285, positive conditional: 0, positive unconditional: 285, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 86, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 86, negative conditional: 0, negative unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1564, positive: 1187, positive conditional: 0, positive unconditional: 1187, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 303, unknown conditional: 0, unknown unconditional: 303] , Statistics on independence cache: Total cache size (in pairs): 942, Positive cache size: 893, Positive conditional cache size: 0, Positive unconditional cache size: 893, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 295.3ms, 71 PlacesBefore, 71 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 3086 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 5178 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 970, positive: 852, positive conditional: 0, positive unconditional: 852, negative: 118, negative conditional: 0, negative unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 268, positive: 253, positive conditional: 0, positive unconditional: 253, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 268, positive: 253, positive conditional: 0, positive unconditional: 253, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 268, positive: 252, positive conditional: 0, positive unconditional: 252, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 73, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 65, negative conditional: 0, negative unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 970, positive: 599, positive conditional: 0, positive unconditional: 599, negative: 103, negative conditional: 0, negative unconditional: 103, unknown: 268, unknown conditional: 0, unknown unconditional: 268] , Statistics on independence cache: Total cache size (in pairs): 868, Positive cache size: 812, Positive conditional cache size: 0, Positive unconditional cache size: 812, Negative cache size: 56, Negative conditional cache size: 0, Negative unconditional cache size: 56 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 114.8ms, 77 PlacesBefore, 77 PlacesAfterwards, 104 TransitionsBefore, 104 TransitionsAfterwards, 3518 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1822 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 360, positive: 325, positive conditional: 0, positive unconditional: 325, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 360, positive: 303, positive conditional: 0, positive unconditional: 303, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 29, unknown conditional: 0, unknown unconditional: 29] , Statistics on independence cache: Total cache size (in pairs): 897, Positive cache size: 834, Positive conditional cache size: 0, Positive unconditional cache size: 834, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 106.0ms, 84 PlacesBefore, 84 PlacesAfterwards, 114 TransitionsBefore, 114 TransitionsAfterwards, 3678 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1579 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 232, positive: 201, positive conditional: 0, positive unconditional: 201, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 232, positive: 195, positive conditional: 0, positive unconditional: 195, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 903, Positive cache size: 840, Positive conditional cache size: 0, Positive unconditional cache size: 840, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 142.6ms, 88 PlacesBefore, 88 PlacesAfterwards, 115 TransitionsBefore, 115 TransitionsAfterwards, 3732 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1594 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 232, positive: 201, positive conditional: 0, positive unconditional: 201, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 232, positive: 201, positive conditional: 0, positive unconditional: 201, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 903, Positive cache size: 840, Positive conditional cache size: 0, Positive unconditional cache size: 840, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 320.1ms, 98 PlacesBefore, 98 PlacesAfterwards, 139 TransitionsBefore, 139 TransitionsAfterwards, 4576 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1441 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 102, positive: 81, positive conditional: 0, positive unconditional: 81, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 102, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 905, Positive cache size: 841, Positive conditional cache size: 0, Positive unconditional cache size: 841, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 372.8ms, 100 PlacesBefore, 100 PlacesAfterwards, 139 TransitionsBefore, 139 TransitionsAfterwards, 4558 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1168 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 94, positive: 76, positive conditional: 0, positive unconditional: 76, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 94, positive: 76, positive conditional: 0, positive unconditional: 76, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 905, Positive cache size: 841, Positive conditional cache size: 0, Positive unconditional cache size: 841, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 366.8ms, 102 PlacesBefore, 102 PlacesAfterwards, 139 TransitionsBefore, 139 TransitionsAfterwards, 4516 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1168 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 94, positive: 76, positive conditional: 0, positive unconditional: 76, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 94, positive: 76, positive conditional: 0, positive unconditional: 76, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 905, Positive cache size: 841, Positive conditional cache size: 0, Positive unconditional cache size: 841, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1158.7ms, 112 PlacesBefore, 112 PlacesAfterwards, 163 TransitionsBefore, 163 TransitionsAfterwards, 5324 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 2185 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 346, positive: 319, positive conditional: 0, positive unconditional: 319, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 346, positive: 313, positive conditional: 0, positive unconditional: 313, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 912, Positive cache size: 847, Positive conditional cache size: 0, Positive unconditional cache size: 847, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 966.5ms, 110 PlacesBefore, 110 PlacesAfterwards, 153 TransitionsBefore, 153 TransitionsAfterwards, 4784 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1706 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 360, positive: 340, positive conditional: 0, positive unconditional: 340, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 64, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 64, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 360, positive: 276, positive conditional: 0, positive unconditional: 276, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 64, unknown conditional: 0, unknown unconditional: 64] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 911, Positive conditional cache size: 0, Positive unconditional cache size: 911, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 577.1ms, 108 PlacesBefore, 108 PlacesAfterwards, 147 TransitionsBefore, 147 TransitionsAfterwards, 4400 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1695 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 473, positive: 452, positive conditional: 0, positive unconditional: 452, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 81, positive: 81, positive conditional: 0, positive unconditional: 81, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 81, positive: 81, positive conditional: 0, positive unconditional: 81, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 81, positive: 81, positive conditional: 0, positive unconditional: 81, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 473, positive: 371, positive conditional: 0, positive unconditional: 371, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 81, unknown conditional: 0, unknown unconditional: 81] , Statistics on independence cache: Total cache size (in pairs): 1057, Positive cache size: 992, Positive conditional cache size: 0, Positive unconditional cache size: 992, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 489.1ms, 128 PlacesBefore, 121 PlacesAfterwards, 135 TransitionsBefore, 133 TransitionsAfterwards, 2780 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 2117 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 441, positive: 405, positive conditional: 0, positive unconditional: 405, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 57, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 57, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 441, positive: 351, positive conditional: 0, positive unconditional: 351, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 57, unknown conditional: 0, unknown unconditional: 57] , Statistics on independence cache: Total cache size (in pairs): 975, Positive cache size: 912, Positive conditional cache size: 0, Positive unconditional cache size: 912, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 278.1ms, 133 PlacesBefore, 133 PlacesAfterwards, 158 TransitionsBefore, 158 TransitionsAfterwards, 2572 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 3826 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 456, positive: 398, positive conditional: 0, positive unconditional: 398, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 456, positive: 389, positive conditional: 0, positive unconditional: 389, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 988, Positive cache size: 921, Positive conditional cache size: 0, Positive unconditional cache size: 921, Negative cache size: 67, Negative conditional cache size: 0, Negative unconditional cache size: 67 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 152.4ms, 146 PlacesBefore, 146 PlacesAfterwards, 156 TransitionsBefore, 156 TransitionsAfterwards, 2524 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1574 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 136, positive: 112, positive conditional: 0, positive unconditional: 112, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 136, positive: 110, positive conditional: 0, positive unconditional: 110, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 990, Positive cache size: 923, Positive conditional cache size: 0, Positive unconditional cache size: 923, Negative cache size: 67, Negative conditional cache size: 0, Negative unconditional cache size: 67 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 268.9ms, 161 PlacesBefore, 161 PlacesAfterwards, 184 TransitionsBefore, 184 TransitionsAfterwards, 2664 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 5393 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1528, positive: 1462, positive conditional: 0, positive unconditional: 1462, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 32, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 32, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1528, positive: 1430, positive conditional: 0, positive unconditional: 1430, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 32, unknown conditional: 0, unknown unconditional: 32] , Statistics on independence cache: Total cache size (in pairs): 1015, Positive cache size: 951, Positive conditional cache size: 0, Positive unconditional cache size: 951, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 323.2ms, 175 PlacesBefore, 173 PlacesAfterwards, 196 TransitionsBefore, 194 TransitionsAfterwards, 2470 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 5289 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1023, positive: 965, positive conditional: 0, positive unconditional: 965, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1023, positive: 956, positive conditional: 0, positive unconditional: 956, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 955, Positive cache size: 893, Positive conditional cache size: 0, Positive unconditional cache size: 893, Negative cache size: 62, Negative conditional cache size: 0, Negative unconditional cache size: 62 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 712.1ms, 175 PlacesBefore, 172 PlacesAfterwards, 212 TransitionsBefore, 210 TransitionsAfterwards, 2554 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 7311 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1512, positive: 1440, positive conditional: 0, positive unconditional: 1440, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, positive: 68, positive conditional: 0, positive unconditional: 68, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 68, positive: 68, positive conditional: 0, positive unconditional: 68, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 68, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1512, positive: 1372, positive conditional: 0, positive unconditional: 1372, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 68, unknown conditional: 0, unknown unconditional: 68] , Statistics on independence cache: Total cache size (in pairs): 921, Positive cache size: 864, Positive conditional cache size: 0, Positive unconditional cache size: 864, Negative cache size: 57, Negative conditional cache size: 0, Negative unconditional cache size: 57 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 249.2ms, 173 PlacesBefore, 172 PlacesAfterwards, 215 TransitionsBefore, 214 TransitionsAfterwards, 2454 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 4416 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 679, positive: 635, positive conditional: 0, positive unconditional: 635, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 679, positive: 629, positive conditional: 0, positive unconditional: 629, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 894, Positive cache size: 837, Positive conditional cache size: 0, Positive unconditional cache size: 837, Negative cache size: 57, Negative conditional cache size: 0, Negative unconditional cache size: 57 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 201.1ms, 181 PlacesBefore, 179 PlacesAfterwards, 224 TransitionsBefore, 224 TransitionsAfterwards, 2452 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 2767 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 447, positive: 421, positive conditional: 0, positive unconditional: 421, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 447, positive: 416, positive conditional: 0, positive unconditional: 416, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 899, Positive cache size: 842, Positive conditional cache size: 0, Positive unconditional cache size: 842, Negative cache size: 57, Negative conditional cache size: 0, Negative unconditional cache size: 57 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 137.9ms, 182 PlacesBefore, 182 PlacesAfterwards, 219 TransitionsBefore, 219 TransitionsAfterwards, 2390 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 3650 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 646, positive: 611, positive conditional: 0, positive unconditional: 611, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 646, positive: 611, positive conditional: 0, positive unconditional: 611, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 899, Positive cache size: 842, Positive conditional cache size: 0, Positive unconditional cache size: 842, Negative cache size: 57, Negative conditional cache size: 0, Negative unconditional cache size: 57 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 107.3ms, 186 PlacesBefore, 185 PlacesAfterwards, 194 TransitionsBefore, 194 TransitionsAfterwards, 2174 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 2607 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 408, positive: 379, positive conditional: 0, positive unconditional: 379, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 408, positive: 379, positive conditional: 0, positive unconditional: 379, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 899, Positive cache size: 842, Positive conditional cache size: 0, Positive unconditional cache size: 842, Negative cache size: 57, Negative conditional cache size: 0, Negative unconditional cache size: 57 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 89.3ms, 183 PlacesBefore, 180 PlacesAfterwards, 185 TransitionsBefore, 185 TransitionsAfterwards, 2040 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1878 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 166, positive: 144, positive conditional: 0, positive unconditional: 144, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 166, positive: 144, positive conditional: 0, positive unconditional: 144, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 899, Positive cache size: 842, Positive conditional cache size: 0, Positive unconditional cache size: 842, Negative cache size: 57, Negative conditional cache size: 0, Negative unconditional cache size: 57 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 65.2ms, 186 PlacesBefore, 181 PlacesAfterwards, 146 TransitionsBefore, 146 TransitionsAfterwards, 1578 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1144 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 188, positive: 170, positive conditional: 0, positive unconditional: 170, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 188, positive: 170, positive conditional: 0, positive unconditional: 170, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 900, Positive cache size: 842, Positive conditional cache size: 0, Positive unconditional cache size: 842, Negative cache size: 58, Negative conditional cache size: 0, Negative unconditional cache size: 58 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 54.1ms, 166 PlacesBefore, 163 PlacesAfterwards, 131 TransitionsBefore, 131 TransitionsAfterwards, 1266 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 705 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 93, positive: 76, positive conditional: 0, positive unconditional: 76, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 93, positive: 75, positive conditional: 0, positive unconditional: 75, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 902, Positive cache size: 843, Positive conditional cache size: 0, Positive unconditional cache size: 843, Negative cache size: 59, Negative conditional cache size: 0, Negative unconditional cache size: 59 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 374.3ms, 178 PlacesBefore, 161 PlacesAfterwards, 133 TransitionsBefore, 129 TransitionsAfterwards, 1040 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 1845 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 836, positive: 782, positive conditional: 0, positive unconditional: 782, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 836, positive: 769, positive conditional: 0, positive unconditional: 769, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 789, Positive cache size: 738, Positive conditional cache size: 0, Positive unconditional cache size: 738, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2090.8ms, 156 PlacesBefore, 122 PlacesAfterwards, 79 TransitionsBefore, 74 TransitionsAfterwards, 444 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 13 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 0 ChoiceCompositions, 23 TotalNumberOfCompositions, 613 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 269, positive: 243, positive conditional: 0, positive unconditional: 243, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 269, positive: 229, positive conditional: 0, positive unconditional: 229, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 674, Positive cache size: 654, Positive conditional cache size: 0, Positive unconditional cache size: 654, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6ms, 82 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 674, Positive cache size: 654, Positive conditional cache size: 0, Positive unconditional cache size: 654, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - PositiveResult [Line: 712]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 719]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 152 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 13.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 34955.3ms, OverallIterations: 28, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 13656.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5338.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 617 SDtfs, 1526 SDslu, 1197 SDs, 0 SdLazy, 5213 SolverSat, 640 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3190.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 1860.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2900occurred in iteration=21, InterpolantAutomatonStates: 240, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 66.0ms SsaConstructionTime, 357.8ms SatisfiabilityAnalysisTime, 1472.9ms InterpolantComputationTime, 626 NumberOfCodeBlocks, 626 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 598 ConstructedInterpolants, 0 QuantifiedInterpolants, 3108 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! Received shutdown request...