/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-0612a5f-m [2022-09-20 20:28:30,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 20:28:30,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 20:28:30,209 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 20:28:30,209 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 20:28:30,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 20:28:30,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 20:28:30,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 20:28:30,213 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 20:28:30,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 20:28:30,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 20:28:30,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 20:28:30,220 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 20:28:30,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 20:28:30,225 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 20:28:30,227 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 20:28:30,227 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 20:28:30,228 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 20:28:30,233 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 20:28:30,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 20:28:30,238 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 20:28:30,238 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 20:28:30,240 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 20:28:30,241 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 20:28:30,246 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 20:28:30,246 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 20:28:30,246 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 20:28:30,247 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 20:28:30,247 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 20:28:30,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 20:28:30,248 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 20:28:30,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 20:28:30,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 20:28:30,249 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 20:28:30,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 20:28:30,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 20:28:30,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 20:28:30,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 20:28:30,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 20:28:30,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 20:28:30,251 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 20:28:30,254 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-09-20 20:28:30,277 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 20:28:30,277 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 20:28:30,278 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 20:28:30,278 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 20:28:30,278 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 20:28:30,278 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 20:28:30,278 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 20:28:30,278 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 20:28:30,279 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 20:28:30,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 20:28:30,279 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 20:28:30,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 20:28:30,279 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 20:28:30,279 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 20:28:30,280 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 20:28:30,280 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 20:28:30,280 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 20:28:30,280 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 20:28:30,280 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 20:28:30,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 20:28:30,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 20:28:30,280 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 20:28:30,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 20:28:30,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 20:28:30,280 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 20:28:30,280 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 20:28:30,281 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 20:28:30,281 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 20:28:30,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 20:28:30,281 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 20:28:30,281 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 20:28:30,281 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-09-20 20:28:30,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 20:28:30,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 20:28:30,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 20:28:30,507 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 20:28:30,508 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 20:28:30,509 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i [2022-09-20 20:28:30,556 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b4a86b8c/2a8353e19b03477eb4075a6b6b3d6772/FLAG4402edd47 [2022-09-20 20:28:30,982 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 20:28:30,983 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i [2022-09-20 20:28:30,995 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b4a86b8c/2a8353e19b03477eb4075a6b6b3d6772/FLAG4402edd47 [2022-09-20 20:28:31,004 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b4a86b8c/2a8353e19b03477eb4075a6b6b3d6772 [2022-09-20 20:28:31,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 20:28:31,006 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 20:28:31,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 20:28:31,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 20:28:31,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 20:28:31,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 08:28:31" (1/1) ... [2022-09-20 20:28:31,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@175aa21e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:28:31, skipping insertion in model container [2022-09-20 20:28:31,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 08:28:31" (1/1) ... [2022-09-20 20:28:31,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 20:28:31,044 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 20:28:31,191 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-09-20 20:28:31,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i[31246,31259] [2022-09-20 20:28:31,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 20:28:31,284 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 20:28:31,293 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-09-20 20:28:31,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i[31246,31259] [2022-09-20 20:28:31,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 20:28:31,338 INFO L208 MainTranslator]: Completed translation [2022-09-20 20:28:31,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:28:31 WrapperNode [2022-09-20 20:28:31,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 20:28:31,339 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 20:28:31,339 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 20:28:31,339 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 20:28:31,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:28:31" (1/1) ... [2022-09-20 20:28:31,367 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:28:31" (1/1) ... [2022-09-20 20:28:31,390 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 114 [2022-09-20 20:28:31,390 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 20:28:31,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 20:28:31,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 20:28:31,391 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 20:28:31,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:28:31" (1/1) ... [2022-09-20 20:28:31,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:28:31" (1/1) ... [2022-09-20 20:28:31,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:28:31" (1/1) ... [2022-09-20 20:28:31,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:28:31" (1/1) ... [2022-09-20 20:28:31,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:28:31" (1/1) ... [2022-09-20 20:28:31,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:28:31" (1/1) ... [2022-09-20 20:28:31,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:28:31" (1/1) ... [2022-09-20 20:28:31,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 20:28:31,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 20:28:31,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 20:28:31,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 20:28:31,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:28:31" (1/1) ... [2022-09-20 20:28:31,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 20:28:31,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 20:28:31,497 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-09-20 20:28:31,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-09-20 20:28:31,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-20 20:28:31,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 20:28:31,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-20 20:28:31,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 20:28:31,566 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2022-09-20 20:28:31,566 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2022-09-20 20:28:31,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 20:28:31,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 20:28:31,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 20:28:31,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-20 20:28:31,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 20:28:31,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 20:28:31,567 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2022-09-20 20:28:31,567 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2022-09-20 20:28:31,568 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-20 20:28:31,646 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 20:28:31,647 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 20:28:31,794 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 20:28:31,832 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 20:28:31,833 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-09-20 20:28:31,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 08:28:31 BoogieIcfgContainer [2022-09-20 20:28:31,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 20:28:31,836 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 20:28:31,836 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 20:28:31,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 20:28:31,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 08:28:31" (1/3) ... [2022-09-20 20:28:31,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676526bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 08:28:31, skipping insertion in model container [2022-09-20 20:28:31,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:28:31" (2/3) ... [2022-09-20 20:28:31,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676526bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 08:28:31, skipping insertion in model container [2022-09-20 20:28:31,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 08:28:31" (3/3) ... [2022-09-20 20:28:31,843 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-1.i [2022-09-20 20:28:31,854 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 20:28:31,854 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-09-20 20:28:31,854 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 20:28:31,923 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-09-20 20:28:31,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 256 flow [2022-09-20 20:28:32,020 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2022-09-20 20:28:32,020 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-09-20 20:28:32,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 108 events. 2/108 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-09-20 20:28:32,024 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 112 transitions, 256 flow [2022-09-20 20:28:32,027 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 94 transitions, 209 flow [2022-09-20 20:28:32,041 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 20:28:32,047 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@28752bbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 20:28:32,047 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-09-20 20:28:32,065 INFO L130 PetriNetUnfolder]: 1/56 cut-off events. [2022-09-20 20:28:32,065 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 20:28:32,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:28:32,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:28:32,067 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:28:32,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:28:32,071 INFO L85 PathProgramCache]: Analyzing trace with hash 764683200, now seen corresponding path program 1 times [2022-09-20 20:28:32,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:28:32,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776854405] [2022-09-20 20:28:32,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:28:32,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:28:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:28:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:28:32,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:28:32,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776854405] [2022-09-20 20:28:32,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776854405] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:28:32,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:28:32,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:28:32,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868919322] [2022-09-20 20:28:32,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:28:32,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:28:32,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:28:32,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:28:32,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:28:32,371 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 112 [2022-09-20 20:28:32,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 94 transitions, 209 flow. Second operand has 6 states, 6 states have (on average 82.83333333333333) internal successors, (497), 6 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:32,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:28:32,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 112 [2022-09-20 20:28:32,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:28:33,313 INFO L130 PetriNetUnfolder]: 3826/7989 cut-off events. [2022-09-20 20:28:33,313 INFO L131 PetriNetUnfolder]: For 1855/1855 co-relation queries the response was YES. [2022-09-20 20:28:33,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14639 conditions, 7989 events. 3826/7989 cut-off events. For 1855/1855 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 71132 event pairs, 1181 based on Foata normal form. 418/8051 useless extension candidates. Maximal degree in co-relation 13913. Up to 2013 conditions per place. [2022-09-20 20:28:33,368 INFO L137 encePairwiseOnDemand]: 101/112 looper letters, 109 selfloop transitions, 24 changer transitions 4/201 dead transitions. [2022-09-20 20:28:33,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 201 transitions, 769 flow [2022-09-20 20:28:33,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 20:28:33,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 20:28:33,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 961 transitions. [2022-09-20 20:28:33,383 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8580357142857142 [2022-09-20 20:28:33,384 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 961 transitions. [2022-09-20 20:28:33,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 961 transitions. [2022-09-20 20:28:33,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:28:33,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 961 transitions. [2022-09-20 20:28:33,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.1) internal successors, (961), 10 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:33,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:33,404 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:33,406 INFO L175 Difference]: Start difference. First operand has 105 places, 94 transitions, 209 flow. Second operand 10 states and 961 transitions. [2022-09-20 20:28:33,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 201 transitions, 769 flow [2022-09-20 20:28:33,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 201 transitions, 713 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-09-20 20:28:33,428 INFO L231 Difference]: Finished difference. Result has 115 places, 117 transitions, 367 flow [2022-09-20 20:28:33,429 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=367, PETRI_PLACES=115, PETRI_TRANSITIONS=117} [2022-09-20 20:28:33,432 INFO L287 CegarLoopForPetriNet]: 105 programPoint places, 10 predicate places. [2022-09-20 20:28:33,432 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 117 transitions, 367 flow [2022-09-20 20:28:33,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.83333333333333) internal successors, (497), 6 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:33,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:28:33,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:28:33,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 20:28:33,434 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:28:33,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:28:33,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1416784543, now seen corresponding path program 1 times [2022-09-20 20:28:33,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:28:33,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448317901] [2022-09-20 20:28:33,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:28:33,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:28:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:28:33,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:28:33,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:28:33,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448317901] [2022-09-20 20:28:33,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448317901] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:28:33,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:28:33,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-20 20:28:33,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485009406] [2022-09-20 20:28:33,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:28:33,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 20:28:33,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:28:33,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 20:28:33,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 20:28:33,540 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 112 [2022-09-20 20:28:33,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 117 transitions, 367 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:33,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:28:33,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 112 [2022-09-20 20:28:33,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:28:33,773 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([249] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][62], [60#L748-4true, 44#writerENTRYtrue, 102#L740true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 71#L740true, 153#true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 116#L721true, Black: 141#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 126#true, readerThread1of1ForFork3InUse]) [2022-09-20 20:28:33,777 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2022-09-20 20:28:33,778 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-09-20 20:28:33,778 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-09-20 20:28:33,778 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-09-20 20:28:33,794 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([249] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][63], [60#L748-4true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 102#L740true, 71#L740true, 155#(= ~w~0 1), Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 116#L721true, Black: 141#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 126#true, readerThread1of1ForFork3InUse, 21#L717-1true]) [2022-09-20 20:28:33,794 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-09-20 20:28:33,794 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-09-20 20:28:33,794 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-09-20 20:28:33,794 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-09-20 20:28:33,805 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([249] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][62], [60#L748-4true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 102#L740true, 71#L740true, 153#true, 94#L721true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 116#L721true, Black: 141#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 126#true, readerThread1of1ForFork3InUse]) [2022-09-20 20:28:33,806 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-09-20 20:28:33,806 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-09-20 20:28:33,806 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-09-20 20:28:33,806 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-09-20 20:28:33,830 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([249] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][62], [107#L749-2true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 102#L740true, 71#L740true, 153#true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 116#L721true, Black: 141#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 126#true, readerThread1of1ForFork3InUse]) [2022-09-20 20:28:33,831 INFO L383 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-09-20 20:28:33,831 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-09-20 20:28:33,831 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-09-20 20:28:33,831 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-09-20 20:28:33,840 INFO L130 PetriNetUnfolder]: 890/2859 cut-off events. [2022-09-20 20:28:33,840 INFO L131 PetriNetUnfolder]: For 676/687 co-relation queries the response was YES. [2022-09-20 20:28:33,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5463 conditions, 2859 events. 890/2859 cut-off events. For 676/687 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 26228 event pairs, 295 based on Foata normal form. 124/2858 useless extension candidates. Maximal degree in co-relation 4840. Up to 649 conditions per place. [2022-09-20 20:28:33,861 INFO L137 encePairwiseOnDemand]: 106/112 looper letters, 19 selfloop transitions, 4 changer transitions 0/124 dead transitions. [2022-09-20 20:28:33,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 124 transitions, 433 flow [2022-09-20 20:28:33,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 20:28:33,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 20:28:33,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2022-09-20 20:28:33,862 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9107142857142857 [2022-09-20 20:28:33,862 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 306 transitions. [2022-09-20 20:28:33,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 306 transitions. [2022-09-20 20:28:33,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:28:33,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 306 transitions. [2022-09-20 20:28:33,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:33,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:33,864 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:33,864 INFO L175 Difference]: Start difference. First operand has 115 places, 117 transitions, 367 flow. Second operand 3 states and 306 transitions. [2022-09-20 20:28:33,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 124 transitions, 433 flow [2022-09-20 20:28:33,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 124 transitions, 433 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-09-20 20:28:33,876 INFO L231 Difference]: Finished difference. Result has 118 places, 117 transitions, 383 flow [2022-09-20 20:28:33,876 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=118, PETRI_TRANSITIONS=117} [2022-09-20 20:28:33,876 INFO L287 CegarLoopForPetriNet]: 105 programPoint places, 13 predicate places. [2022-09-20 20:28:33,876 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 117 transitions, 383 flow [2022-09-20 20:28:33,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:33,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:28:33,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:28:33,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 20:28:33,877 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:28:33,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:28:33,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1184537247, now seen corresponding path program 2 times [2022-09-20 20:28:33,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:28:33,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024871100] [2022-09-20 20:28:33,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:28:33,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:28:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:28:33,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:28:33,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:28:33,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024871100] [2022-09-20 20:28:33,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024871100] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:28:33,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:28:33,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-09-20 20:28:33,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436014049] [2022-09-20 20:28:33,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:28:33,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-20 20:28:33,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:28:33,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-20 20:28:33,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-20 20:28:33,978 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 112 [2022-09-20 20:28:33,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 117 transitions, 383 flow. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:33,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:28:33,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 112 [2022-09-20 20:28:33,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:28:34,286 INFO L130 PetriNetUnfolder]: 764/3304 cut-off events. [2022-09-20 20:28:34,286 INFO L131 PetriNetUnfolder]: For 1453/1513 co-relation queries the response was YES. [2022-09-20 20:28:34,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6340 conditions, 3304 events. 764/3304 cut-off events. For 1453/1513 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 34911 event pairs, 48 based on Foata normal form. 67/3219 useless extension candidates. Maximal degree in co-relation 5566. Up to 527 conditions per place. [2022-09-20 20:28:34,308 INFO L137 encePairwiseOnDemand]: 103/112 looper letters, 27 selfloop transitions, 19 changer transitions 2/148 dead transitions. [2022-09-20 20:28:34,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 148 transitions, 585 flow [2022-09-20 20:28:34,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-20 20:28:34,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-09-20 20:28:34,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2022-09-20 20:28:34,310 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9107142857142857 [2022-09-20 20:28:34,310 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 510 transitions. [2022-09-20 20:28:34,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 510 transitions. [2022-09-20 20:28:34,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:28:34,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 510 transitions. [2022-09-20 20:28:34,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:34,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:34,313 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:34,313 INFO L175 Difference]: Start difference. First operand has 118 places, 117 transitions, 383 flow. Second operand 5 states and 510 transitions. [2022-09-20 20:28:34,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 148 transitions, 585 flow [2022-09-20 20:28:34,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 148 transitions, 565 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 20:28:34,321 INFO L231 Difference]: Finished difference. Result has 120 places, 131 transitions, 461 flow [2022-09-20 20:28:34,321 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=461, PETRI_PLACES=120, PETRI_TRANSITIONS=131} [2022-09-20 20:28:34,323 INFO L287 CegarLoopForPetriNet]: 105 programPoint places, 15 predicate places. [2022-09-20 20:28:34,323 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 131 transitions, 461 flow [2022-09-20 20:28:34,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:34,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:28:34,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:28:34,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 20:28:34,324 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:28:34,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:28:34,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1149119989, now seen corresponding path program 1 times [2022-09-20 20:28:34,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:28:34,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759785772] [2022-09-20 20:28:34,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:28:34,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:28:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:28:34,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:28:34,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:28:34,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759785772] [2022-09-20 20:28:34,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759785772] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:28:34,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:28:34,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:28:34,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288215260] [2022-09-20 20:28:34,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:28:34,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:28:34,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:28:34,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:28:34,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:28:34,370 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 112 [2022-09-20 20:28:34,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 131 transitions, 461 flow. Second operand has 6 states, 6 states have (on average 83.16666666666667) internal successors, (499), 6 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:34,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:28:34,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 112 [2022-09-20 20:28:34,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:28:35,562 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([249] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][355], [60#L748-4true, 170#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), 102#L740true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 71#L740true, 158#true, 94#L721true, 116#L721true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 141#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 126#true, readerThread1of1ForFork3InUse, Black: 155#(= ~w~0 1)]) [2022-09-20 20:28:35,562 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-09-20 20:28:35,563 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-09-20 20:28:35,566 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-09-20 20:28:35,567 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-09-20 20:28:35,897 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([249] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][355], [170#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), 107#L749-2true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 102#L740true, 71#L740true, 158#true, 116#L721true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 141#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 126#true, readerThread1of1ForFork3InUse, Black: 155#(= ~w~0 1)]) [2022-09-20 20:28:35,897 INFO L383 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-09-20 20:28:35,897 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-09-20 20:28:35,897 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-09-20 20:28:35,897 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-09-20 20:28:36,003 INFO L130 PetriNetUnfolder]: 8503/19148 cut-off events. [2022-09-20 20:28:36,004 INFO L131 PetriNetUnfolder]: For 16785/16832 co-relation queries the response was YES. [2022-09-20 20:28:36,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47526 conditions, 19148 events. 8503/19148 cut-off events. For 16785/16832 co-relation queries the response was YES. Maximal size of possible extension queue 1820. Compared 217647 event pairs, 1734 based on Foata normal form. 13/18572 useless extension candidates. Maximal degree in co-relation 46936. Up to 4078 conditions per place. [2022-09-20 20:28:36,124 INFO L137 encePairwiseOnDemand]: 103/112 looper letters, 193 selfloop transitions, 94 changer transitions 32/387 dead transitions. [2022-09-20 20:28:36,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 387 transitions, 2315 flow [2022-09-20 20:28:36,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 20:28:36,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 20:28:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 950 transitions. [2022-09-20 20:28:36,127 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8482142857142857 [2022-09-20 20:28:36,127 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 950 transitions. [2022-09-20 20:28:36,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 950 transitions. [2022-09-20 20:28:36,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:28:36,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 950 transitions. [2022-09-20 20:28:36,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 95.0) internal successors, (950), 10 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:36,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:36,130 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:36,130 INFO L175 Difference]: Start difference. First operand has 120 places, 131 transitions, 461 flow. Second operand 10 states and 950 transitions. [2022-09-20 20:28:36,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 387 transitions, 2315 flow [2022-09-20 20:28:36,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 387 transitions, 2309 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-09-20 20:28:36,238 INFO L231 Difference]: Finished difference. Result has 137 places, 240 transitions, 1484 flow [2022-09-20 20:28:36,239 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1484, PETRI_PLACES=137, PETRI_TRANSITIONS=240} [2022-09-20 20:28:36,239 INFO L287 CegarLoopForPetriNet]: 105 programPoint places, 32 predicate places. [2022-09-20 20:28:36,239 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 240 transitions, 1484 flow [2022-09-20 20:28:36,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.16666666666667) internal successors, (499), 6 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:36,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:28:36,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:28:36,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 20:28:36,240 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:28:36,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:28:36,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1910529791, now seen corresponding path program 1 times [2022-09-20 20:28:36,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:28:36,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664203024] [2022-09-20 20:28:36,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:28:36,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:28:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:28:36,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:28:36,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:28:36,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664203024] [2022-09-20 20:28:36,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664203024] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:28:36,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:28:36,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:28:36,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093174158] [2022-09-20 20:28:36,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:28:36,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:28:36,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:28:36,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:28:36,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:28:36,276 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 112 [2022-09-20 20:28:36,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 240 transitions, 1484 flow. Second operand has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:36,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:28:36,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 112 [2022-09-20 20:28:36,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:28:37,897 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([263] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][400], [60#L748-4true, 170#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), 102#L740true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 158#true, 94#L721true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 141#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 126#true, Black: 155#(= ~w~0 1), 71#L740true, 197#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 116#L721true, readerThread1of1ForFork3InUse, Black: 172#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 180#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 165#true, Black: 176#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 174#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 167#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 178#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2022-09-20 20:28:37,897 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-09-20 20:28:37,898 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-09-20 20:28:37,898 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-09-20 20:28:37,898 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-09-20 20:28:38,262 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([263] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][400], [170#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), 107#L749-2true, 102#L740true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 71#L740true, 197#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 158#true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 116#L721true, Black: 141#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), readerThread1of1ForFork3InUse, Black: 126#true, Black: 172#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 180#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 165#true, Black: 176#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 174#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~w~0 1), Black: 167#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 178#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2022-09-20 20:28:38,262 INFO L383 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-09-20 20:28:38,262 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-09-20 20:28:38,262 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-09-20 20:28:38,262 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-09-20 20:28:38,469 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([263] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][400], [170#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 71#L740true, 197#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 158#true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 116#L721true, Black: 141#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), readerThread1of1ForFork3InUse, Black: 126#true, Black: 172#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 180#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 45#L750-2true, Black: 165#true, Black: 176#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 174#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 155#(= ~w~0 1), Black: 167#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 178#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2022-09-20 20:28:38,470 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-09-20 20:28:38,470 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-09-20 20:28:38,470 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-09-20 20:28:38,470 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-09-20 20:28:38,500 INFO L130 PetriNetUnfolder]: 8574/19932 cut-off events. [2022-09-20 20:28:38,500 INFO L131 PetriNetUnfolder]: For 32598/32645 co-relation queries the response was YES. [2022-09-20 20:28:38,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59393 conditions, 19932 events. 8574/19932 cut-off events. For 32598/32645 co-relation queries the response was YES. Maximal size of possible extension queue 1948. Compared 230622 event pairs, 1383 based on Foata normal form. 192/19932 useless extension candidates. Maximal degree in co-relation 58742. Up to 3646 conditions per place. [2022-09-20 20:28:38,632 INFO L137 encePairwiseOnDemand]: 103/112 looper letters, 187 selfloop transitions, 131 changer transitions 43/429 dead transitions. [2022-09-20 20:28:38,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 429 transitions, 3375 flow [2022-09-20 20:28:38,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 20:28:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 20:28:38,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 849 transitions. [2022-09-20 20:28:38,634 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8422619047619048 [2022-09-20 20:28:38,634 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 849 transitions. [2022-09-20 20:28:38,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 849 transitions. [2022-09-20 20:28:38,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:28:38,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 849 transitions. [2022-09-20 20:28:38,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 94.33333333333333) internal successors, (849), 9 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:38,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 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) [2022-09-20 20:28:38,637 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 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) [2022-09-20 20:28:38,637 INFO L175 Difference]: Start difference. First operand has 137 places, 240 transitions, 1484 flow. Second operand 9 states and 849 transitions. [2022-09-20 20:28:38,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 429 transitions, 3375 flow [2022-09-20 20:28:38,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 429 transitions, 3375 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-09-20 20:28:38,890 INFO L231 Difference]: Finished difference. Result has 150 places, 282 transitions, 2293 flow [2022-09-20 20:28:38,890 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=1484, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2293, PETRI_PLACES=150, PETRI_TRANSITIONS=282} [2022-09-20 20:28:38,891 INFO L287 CegarLoopForPetriNet]: 105 programPoint places, 45 predicate places. [2022-09-20 20:28:38,891 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 282 transitions, 2293 flow [2022-09-20 20:28:38,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:38,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:28:38,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:28:38,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-20 20:28:38,892 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:28:38,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:28:38,892 INFO L85 PathProgramCache]: Analyzing trace with hash -2041915451, now seen corresponding path program 1 times [2022-09-20 20:28:38,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:28:38,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560279602] [2022-09-20 20:28:38,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:28:38,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:28:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:28:38,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:28:38,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:28:38,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560279602] [2022-09-20 20:28:38,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560279602] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:28:38,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:28:38,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:28:38,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291439647] [2022-09-20 20:28:38,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:28:38,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:28:38,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:28:38,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:28:38,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:28:38,927 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 112 [2022-09-20 20:28:38,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 282 transitions, 2293 flow. Second operand has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:38,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:28:38,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 112 [2022-09-20 20:28:38,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:28:40,517 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([249] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][399], [60#L748-4true, 220#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), 170#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), 161#(or (not (= ~w~0 0)) (not (= ~r~0 0))), 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 102#L740true, 94#L721true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 141#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 199#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 192#true, Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 206#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 202#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 126#true, Black: 155#(= ~w~0 1), 197#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 116#L721true, 27#L739-2true, readerThread1of1ForFork3InUse, Black: 172#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 180#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 165#true, Black: 176#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 174#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 167#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 178#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2022-09-20 20:28:40,517 INFO L383 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-09-20 20:28:40,517 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-09-20 20:28:40,517 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-09-20 20:28:40,517 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-09-20 20:28:41,100 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([249] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][399], [220#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), 170#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), 161#(or (not (= ~w~0 0)) (not (= ~r~0 0))), 107#L749-2true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 102#L740true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 141#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 199#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 192#true, Black: 206#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 202#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 126#true, Black: 155#(= ~w~0 1), 197#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 116#L721true, 27#L739-2true, readerThread1of1ForFork3InUse, Black: 172#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 180#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 165#true, Black: 176#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 174#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 167#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 178#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2022-09-20 20:28:41,100 INFO L383 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-09-20 20:28:41,100 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-09-20 20:28:41,101 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-09-20 20:28:41,101 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-09-20 20:28:41,342 INFO L130 PetriNetUnfolder]: 9007/21302 cut-off events. [2022-09-20 20:28:41,342 INFO L131 PetriNetUnfolder]: For 48784/48840 co-relation queries the response was YES. [2022-09-20 20:28:41,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66805 conditions, 21302 events. 9007/21302 cut-off events. For 48784/48840 co-relation queries the response was YES. Maximal size of possible extension queue 2128. Compared 254550 event pairs, 1694 based on Foata normal form. 234/21336 useless extension candidates. Maximal degree in co-relation 66043. Up to 4373 conditions per place. [2022-09-20 20:28:41,476 INFO L137 encePairwiseOnDemand]: 103/112 looper letters, 219 selfloop transitions, 163 changer transitions 29/486 dead transitions. [2022-09-20 20:28:41,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 486 transitions, 4497 flow [2022-09-20 20:28:41,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 20:28:41,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 20:28:41,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 859 transitions. [2022-09-20 20:28:41,478 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8521825396825397 [2022-09-20 20:28:41,478 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 859 transitions. [2022-09-20 20:28:41,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 859 transitions. [2022-09-20 20:28:41,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:28:41,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 859 transitions. [2022-09-20 20:28:41,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.44444444444444) internal successors, (859), 9 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:41,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 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) [2022-09-20 20:28:41,481 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 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) [2022-09-20 20:28:41,482 INFO L175 Difference]: Start difference. First operand has 150 places, 282 transitions, 2293 flow. Second operand 9 states and 859 transitions. [2022-09-20 20:28:41,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 486 transitions, 4497 flow [2022-09-20 20:28:41,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 486 transitions, 4469 flow, removed 14 selfloop flow, removed 0 redundant places. [2022-09-20 20:28:41,803 INFO L231 Difference]: Finished difference. Result has 163 places, 343 transitions, 3468 flow [2022-09-20 20:28:41,803 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=2283, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3468, PETRI_PLACES=163, PETRI_TRANSITIONS=343} [2022-09-20 20:28:41,804 INFO L287 CegarLoopForPetriNet]: 105 programPoint places, 58 predicate places. [2022-09-20 20:28:41,804 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 343 transitions, 3468 flow [2022-09-20 20:28:41,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:41,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:28:41,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:28:41,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-20 20:28:41,805 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:28:41,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:28:41,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1454800673, now seen corresponding path program 1 times [2022-09-20 20:28:41,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:28:41,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817734771] [2022-09-20 20:28:41,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:28:41,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:28:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:28:41,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:28:41,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:28:41,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817734771] [2022-09-20 20:28:41,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817734771] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:28:41,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:28:41,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-09-20 20:28:41,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685699831] [2022-09-20 20:28:41,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:28:41,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-09-20 20:28:41,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:28:41,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-09-20 20:28:41,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-09-20 20:28:41,845 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 112 [2022-09-20 20:28:41,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 343 transitions, 3468 flow. Second operand has 5 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:41,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:28:41,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 112 [2022-09-20 20:28:41,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:28:42,235 INFO L130 PetriNetUnfolder]: 387/2261 cut-off events. [2022-09-20 20:28:42,235 INFO L131 PetriNetUnfolder]: For 4229/4407 co-relation queries the response was YES. [2022-09-20 20:28:42,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6409 conditions, 2261 events. 387/2261 cut-off events. For 4229/4407 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 22734 event pairs, 50 based on Foata normal form. 134/2373 useless extension candidates. Maximal degree in co-relation 6159. Up to 285 conditions per place. [2022-09-20 20:28:42,245 INFO L137 encePairwiseOnDemand]: 105/112 looper letters, 18 selfloop transitions, 9 changer transitions 35/190 dead transitions. [2022-09-20 20:28:42,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 190 transitions, 1296 flow [2022-09-20 20:28:42,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-20 20:28:42,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-09-20 20:28:42,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 516 transitions. [2022-09-20 20:28:42,246 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9214285714285714 [2022-09-20 20:28:42,246 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 516 transitions. [2022-09-20 20:28:42,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 516 transitions. [2022-09-20 20:28:42,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:28:42,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 516 transitions. [2022-09-20 20:28:42,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:42,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:42,249 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:42,249 INFO L175 Difference]: Start difference. First operand has 163 places, 343 transitions, 3468 flow. Second operand 5 states and 516 transitions. [2022-09-20 20:28:42,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 190 transitions, 1296 flow [2022-09-20 20:28:42,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 190 transitions, 1227 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-09-20 20:28:42,265 INFO L231 Difference]: Finished difference. Result has 163 places, 148 transitions, 877 flow [2022-09-20 20:28:42,265 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=877, PETRI_PLACES=163, PETRI_TRANSITIONS=148} [2022-09-20 20:28:42,265 INFO L287 CegarLoopForPetriNet]: 105 programPoint places, 58 predicate places. [2022-09-20 20:28:42,266 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 148 transitions, 877 flow [2022-09-20 20:28:42,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:42,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:28:42,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:28:42,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-20 20:28:42,266 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:28:42,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:28:42,267 INFO L85 PathProgramCache]: Analyzing trace with hash -783498844, now seen corresponding path program 1 times [2022-09-20 20:28:42,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:28:42,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39921929] [2022-09-20 20:28:42,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:28:42,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:28:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:28:42,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:28:42,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:28:42,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39921929] [2022-09-20 20:28:42,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39921929] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:28:42,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:28:42,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-09-20 20:28:42,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724899381] [2022-09-20 20:28:42,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:28:42,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-09-20 20:28:42,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:28:42,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-09-20 20:28:42,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-09-20 20:28:42,315 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 112 [2022-09-20 20:28:42,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 148 transitions, 877 flow. Second operand has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:42,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:28:42,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 112 [2022-09-20 20:28:42,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:28:42,384 INFO L130 PetriNetUnfolder]: 78/689 cut-off events. [2022-09-20 20:28:42,384 INFO L131 PetriNetUnfolder]: For 956/959 co-relation queries the response was YES. [2022-09-20 20:28:42,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2003 conditions, 689 events. 78/689 cut-off events. For 956/959 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4688 event pairs, 19 based on Foata normal form. 11/696 useless extension candidates. Maximal degree in co-relation 1975. Up to 81 conditions per place. [2022-09-20 20:28:42,387 INFO L137 encePairwiseOnDemand]: 105/112 looper letters, 0 selfloop transitions, 0 changer transitions 118/118 dead transitions. [2022-09-20 20:28:42,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 118 transitions, 556 flow [2022-09-20 20:28:42,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-09-20 20:28:42,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-09-20 20:28:42,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 505 transitions. [2022-09-20 20:28:42,388 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9017857142857143 [2022-09-20 20:28:42,388 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 505 transitions. [2022-09-20 20:28:42,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 505 transitions. [2022-09-20 20:28:42,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:28:42,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 505 transitions. [2022-09-20 20:28:42,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:42,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:42,391 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:42,391 INFO L175 Difference]: Start difference. First operand has 163 places, 148 transitions, 877 flow. Second operand 5 states and 505 transitions. [2022-09-20 20:28:42,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 118 transitions, 556 flow [2022-09-20 20:28:42,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 118 transitions, 438 flow, removed 12 selfloop flow, removed 26 redundant places. [2022-09-20 20:28:42,395 INFO L231 Difference]: Finished difference. Result has 129 places, 0 transitions, 0 flow [2022-09-20 20:28:42,395 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=129, PETRI_TRANSITIONS=0} [2022-09-20 20:28:42,396 INFO L287 CegarLoopForPetriNet]: 105 programPoint places, 24 predicate places. [2022-09-20 20:28:42,396 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 0 transitions, 0 flow [2022-09-20 20:28:42,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:28:42,398 INFO L805 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-09-20 20:28:42,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2022-09-20 20:28:42,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-09-20 20:28:42,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-09-20 20:28:42,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-09-20 20:28:42,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-09-20 20:28:42,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-09-20 20:28:42,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-20 20:28:42,400 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-09-20 20:28:42,403 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-20 20:28:42,403 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-20 20:28:42,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 08:28:42 BasicIcfg [2022-09-20 20:28:42,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-20 20:28:42,408 INFO L158 Benchmark]: Toolchain (without parser) took 11401.48ms. Allocated memory was 174.1MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 141.7MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 629.3MB. Max. memory is 8.0GB. [2022-09-20 20:28:42,408 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 174.1MB. Free memory is still 129.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-20 20:28:42,408 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.48ms. Allocated memory was 174.1MB in the beginning and 287.3MB in the end (delta: 113.2MB). Free memory was 141.5MB in the beginning and 246.8MB in the end (delta: -105.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-09-20 20:28:42,409 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.26ms. Allocated memory is still 287.3MB. Free memory was 246.8MB in the beginning and 244.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-20 20:28:42,409 INFO L158 Benchmark]: Boogie Preprocessor took 28.99ms. Allocated memory is still 287.3MB. Free memory was 244.4MB in the beginning and 243.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-20 20:28:42,409 INFO L158 Benchmark]: RCFGBuilder took 413.93ms. Allocated memory is still 287.3MB. Free memory was 243.0MB in the beginning and 228.6MB in the end (delta: 14.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-09-20 20:28:42,410 INFO L158 Benchmark]: TraceAbstraction took 10571.60ms. Allocated memory was 287.3MB in the beginning and 3.1GB in the end (delta: 2.8GB). Free memory was 227.7MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 602.1MB. Max. memory is 8.0GB. [2022-09-20 20:28:42,411 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.12ms. Allocated memory is still 174.1MB. Free memory is still 129.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 331.48ms. Allocated memory was 174.1MB in the beginning and 287.3MB in the end (delta: 113.2MB). Free memory was 141.5MB in the beginning and 246.8MB in the end (delta: -105.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.26ms. Allocated memory is still 287.3MB. Free memory was 246.8MB in the beginning and 244.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.99ms. Allocated memory is still 287.3MB. Free memory was 244.4MB in the beginning and 243.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 413.93ms. Allocated memory is still 287.3MB. Free memory was 243.0MB in the beginning and 228.6MB in the end (delta: 14.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 10571.60ms. Allocated memory was 287.3MB in the beginning and 3.1GB in the end (delta: 2.8GB). Free memory was 227.7MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 602.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 739]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 136 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 442 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 442 mSDsluCounter, 269 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 675 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1315 IncrementalHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 120 mSDtfsCounter, 1315 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3468occurred in iteration=6, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 406 NumberOfCodeBlocks, 406 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 398 ConstructedInterpolants, 0 QuantifiedInterpolants, 692 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-09-20 20:28:42,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...