/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:06:26,402 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:06:26,404 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:06:26,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:06:26,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:06:26,443 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:06:26,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:06:26,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:06:26,453 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:06:26,454 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:06:26,455 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:06:26,456 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:06:26,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:06:26,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:06:26,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:06:26,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:06:26,460 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:06:26,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:06:26,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:06:26,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:06:26,465 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:06:26,470 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:06:26,472 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:06:26,473 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:06:26,476 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:06:26,476 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:06:26,476 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:06:26,477 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:06:26,477 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:06:26,478 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:06:26,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:06:26,479 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:06:26,479 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:06:26,480 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:06:26,481 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:06:26,481 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:06:26,481 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:06:26,481 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:06:26,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:06:26,482 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:06:26,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:06:26,483 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:06:26,515 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:06:26,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:06:26,517 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:06:26,517 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:06:26,518 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:06:26,518 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:06:26,518 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:06:26,519 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:06:26,519 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:06:26,519 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:06:26,520 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:06:26,520 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:06:26,520 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:06:26,520 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:06:26,520 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:06:26,520 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:06:26,520 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:06:26,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:06:26,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:06:26,521 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:06:26,521 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:06:26,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:06:26,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:06:26,521 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:06:26,521 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:06:26,522 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:06:26,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:06:26,522 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:06:26,522 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-12-06 04:06:26,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:06:26,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:06:26,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:06:26,863 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:06:26,863 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:06:26,864 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-12-06 04:06:27,880 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:06:28,149 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:06:28,149 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i [2022-12-06 04:06:28,169 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3da3db286/f1931740731740f99b9f718d9298a0df/FLAG48bb43fa2 [2022-12-06 04:06:28,184 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3da3db286/f1931740731740f99b9f718d9298a0df [2022-12-06 04:06:28,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:06:28,187 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:06:28,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:06:28,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:06:28,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:06:28,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:06:28" (1/1) ... [2022-12-06 04:06:28,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11e271e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:28, skipping insertion in model container [2022-12-06 04:06:28,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:06:28" (1/1) ... [2022-12-06 04:06:28,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:06:28,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:06:28,434 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-06 04:06:28,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:28,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:28,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:28,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:28,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:28,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:28,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:28,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:28,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:28,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:28,562 WARN L237 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-12-06 04:06:28,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:06:28,583 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:06:28,612 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-06 04:06:28,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:28,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:28,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:28,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:28,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:28,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:28,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:28,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:28,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:28,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:28,647 WARN L237 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-12-06 04:06:28,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:06:28,703 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:06:28,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:28 WrapperNode [2022-12-06 04:06:28,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:06:28,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:06:28,705 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:06:28,706 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:06:28,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:28" (1/1) ... [2022-12-06 04:06:28,728 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:28" (1/1) ... [2022-12-06 04:06:28,752 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 114 [2022-12-06 04:06:28,752 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:06:28,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:06:28,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:06:28,753 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:06:28,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:28" (1/1) ... [2022-12-06 04:06:28,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:28" (1/1) ... [2022-12-06 04:06:28,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:28" (1/1) ... [2022-12-06 04:06:28,779 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:28" (1/1) ... [2022-12-06 04:06:28,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:28" (1/1) ... [2022-12-06 04:06:28,786 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:28" (1/1) ... [2022-12-06 04:06:28,799 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:28" (1/1) ... [2022-12-06 04:06:28,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:28" (1/1) ... [2022-12-06 04:06:28,803 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:06:28,804 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:06:28,804 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:06:28,804 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:06:28,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:28" (1/1) ... [2022-12-06 04:06:28,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:06:28,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:06:28,840 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-12-06 04:06:28,856 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-12-06 04:06:28,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:06:28,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:06:28,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:06:28,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:06:28,883 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2022-12-06 04:06:28,883 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2022-12-06 04:06:28,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:06:28,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:06:28,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:06:28,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:06:28,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:06:28,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:06:28,884 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2022-12-06 04:06:28,884 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2022-12-06 04:06:28,886 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:06:28,995 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:06:28,997 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:06:29,206 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:06:29,238 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:06:29,238 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:06:29,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:06:29 BoogieIcfgContainer [2022-12-06 04:06:29,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:06:29,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:06:29,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:06:29,246 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:06:29,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:06:28" (1/3) ... [2022-12-06 04:06:29,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c6da5d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:06:29, skipping insertion in model container [2022-12-06 04:06:29,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:28" (2/3) ... [2022-12-06 04:06:29,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c6da5d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:06:29, skipping insertion in model container [2022-12-06 04:06:29,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:06:29" (3/3) ... [2022-12-06 04:06:29,249 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-1.i [2022-12-06 04:06:29,266 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:06:29,267 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:06:29,267 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:06:29,400 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 04:06:29,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 248 flow [2022-12-06 04:06:29,512 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-06 04:06:29,512 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 04:06:29,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 104 events. 2/104 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-06 04:06:29,518 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 108 transitions, 248 flow [2022-12-06 04:06:29,522 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 91 transitions, 203 flow [2022-12-06 04:06:29,524 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:29,543 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 91 transitions, 203 flow [2022-12-06 04:06:29,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 91 transitions, 203 flow [2022-12-06 04:06:29,587 INFO L130 PetriNetUnfolder]: 2/91 cut-off events. [2022-12-06 04:06:29,587 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 04:06:29,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 91 events. 2/91 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-06 04:06:29,592 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 91 transitions, 203 flow [2022-12-06 04:06:29,592 INFO L188 LiptonReduction]: Number of co-enabled transitions 2408 [2022-12-06 04:06:32,880 INFO L203 LiptonReduction]: Total number of compositions: 64 [2022-12-06 04:06:32,893 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:06:32,898 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=REPEATED_LIPTON_PN, 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;@5f71210b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:06:32,898 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 04:06:32,904 INFO L130 PetriNetUnfolder]: 1/23 cut-off events. [2022-12-06 04:06:32,905 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:06:32,905 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:32,906 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:32,906 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-12-06 04:06:32,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:32,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1362193144, now seen corresponding path program 1 times [2022-12-06 04:06:32,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:32,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084865553] [2022-12-06 04:06:32,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:32,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:33,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:33,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:33,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084865553] [2022-12-06 04:06:33,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084865553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:33,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:33,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:06:33,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543060663] [2022-12-06 04:06:33,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:33,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:06:33,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:33,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:06:33,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:06:33,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 41 [2022-12-06 04:06:33,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 103 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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-12-06 04:06:33,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:33,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 41 [2022-12-06 04:06:33,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:35,297 INFO L130 PetriNetUnfolder]: 18195/25459 cut-off events. [2022-12-06 04:06:35,297 INFO L131 PetriNetUnfolder]: For 2458/2458 co-relation queries the response was YES. [2022-12-06 04:06:35,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52327 conditions, 25459 events. 18195/25459 cut-off events. For 2458/2458 co-relation queries the response was YES. Maximal size of possible extension queue 754. Compared 143988 event pairs, 2689 based on Foata normal form. 0/23081 useless extension candidates. Maximal degree in co-relation 41071. Up to 11997 conditions per place. [2022-12-06 04:06:35,539 INFO L137 encePairwiseOnDemand]: 30/41 looper letters, 150 selfloop transitions, 22 changer transitions 3/177 dead transitions. [2022-12-06 04:06:35,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 177 transitions, 791 flow [2022-12-06 04:06:35,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:06:35,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:06:35,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2022-12-06 04:06:35,551 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6128048780487805 [2022-12-06 04:06:35,552 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 103 flow. Second operand 8 states and 201 transitions. [2022-12-06 04:06:35,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 177 transitions, 791 flow [2022-12-06 04:06:35,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 177 transitions, 739 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-12-06 04:06:35,579 INFO L231 Difference]: Finished difference. Result has 58 places, 59 transitions, 233 flow [2022-12-06 04:06:35,581 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=233, PETRI_PLACES=58, PETRI_TRANSITIONS=59} [2022-12-06 04:06:35,583 INFO L294 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2022-12-06 04:06:35,584 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:35,584 INFO L89 Accepts]: Start accepts. Operand has 58 places, 59 transitions, 233 flow [2022-12-06 04:06:35,588 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:35,588 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:35,588 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 59 transitions, 233 flow [2022-12-06 04:06:35,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 59 transitions, 233 flow [2022-12-06 04:06:35,612 INFO L130 PetriNetUnfolder]: 60/324 cut-off events. [2022-12-06 04:06:35,613 INFO L131 PetriNetUnfolder]: For 121/144 co-relation queries the response was YES. [2022-12-06 04:06:35,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 324 events. 60/324 cut-off events. For 121/144 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2147 event pairs, 1 based on Foata normal form. 0/292 useless extension candidates. Maximal degree in co-relation 594. Up to 67 conditions per place. [2022-12-06 04:06:35,617 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 59 transitions, 233 flow [2022-12-06 04:06:35,617 INFO L188 LiptonReduction]: Number of co-enabled transitions 1314 [2022-12-06 04:06:35,646 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:35,648 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-06 04:06:35,648 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 59 transitions, 233 flow [2022-12-06 04:06:35,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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-12-06 04:06:35,649 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:35,649 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:35,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:06:35,649 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-12-06 04:06:35,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:35,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1466669212, now seen corresponding path program 1 times [2022-12-06 04:06:35,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:35,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012280993] [2022-12-06 04:06:35,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:35,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:35,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:35,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012280993] [2022-12-06 04:06:35,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012280993] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:35,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:35,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:06:35,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654771868] [2022-12-06 04:06:35,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:35,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:06:35,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:35,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:06:35,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:06:35,741 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2022-12-06 04:06:35,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 59 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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-12-06 04:06:35,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:35,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2022-12-06 04:06:35,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:36,595 INFO L130 PetriNetUnfolder]: 6168/10182 cut-off events. [2022-12-06 04:06:36,596 INFO L131 PetriNetUnfolder]: For 4528/4952 co-relation queries the response was YES. [2022-12-06 04:06:36,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23804 conditions, 10182 events. 6168/10182 cut-off events. For 4528/4952 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 75511 event pairs, 1937 based on Foata normal form. 832/9903 useless extension candidates. Maximal degree in co-relation 17238. Up to 4261 conditions per place. [2022-12-06 04:06:36,770 INFO L137 encePairwiseOnDemand]: 33/39 looper letters, 48 selfloop transitions, 4 changer transitions 0/80 dead transitions. [2022-12-06 04:06:36,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 80 transitions, 400 flow [2022-12-06 04:06:36,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:06:36,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:06:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-12-06 04:06:36,772 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7008547008547008 [2022-12-06 04:06:36,772 INFO L175 Difference]: Start difference. First operand has 58 places, 59 transitions, 233 flow. Second operand 3 states and 82 transitions. [2022-12-06 04:06:36,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 80 transitions, 400 flow [2022-12-06 04:06:36,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 80 transitions, 400 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:06:36,796 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 249 flow [2022-12-06 04:06:36,796 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=249, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2022-12-06 04:06:36,797 INFO L294 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2022-12-06 04:06:36,797 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:36,797 INFO L89 Accepts]: Start accepts. Operand has 61 places, 59 transitions, 249 flow [2022-12-06 04:06:36,798 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:36,798 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:36,799 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 59 transitions, 249 flow [2022-12-06 04:06:36,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 59 transitions, 249 flow [2022-12-06 04:06:36,834 INFO L130 PetriNetUnfolder]: 99/589 cut-off events. [2022-12-06 04:06:36,834 INFO L131 PetriNetUnfolder]: For 192/195 co-relation queries the response was YES. [2022-12-06 04:06:36,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1202 conditions, 589 events. 99/589 cut-off events. For 192/195 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4851 event pairs, 29 based on Foata normal form. 0/543 useless extension candidates. Maximal degree in co-relation 1178. Up to 97 conditions per place. [2022-12-06 04:06:36,842 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 59 transitions, 249 flow [2022-12-06 04:06:36,842 INFO L188 LiptonReduction]: Number of co-enabled transitions 1208 [2022-12-06 04:06:37,165 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:06:37,166 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 369 [2022-12-06 04:06:37,166 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 285 flow [2022-12-06 04:06:37,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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-12-06 04:06:37,166 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:37,167 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:37,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:06:37,167 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-12-06 04:06:37,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:37,167 INFO L85 PathProgramCache]: Analyzing trace with hash -965066460, now seen corresponding path program 2 times [2022-12-06 04:06:37,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:37,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633631934] [2022-12-06 04:06:37,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:37,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:37,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:37,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:37,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633631934] [2022-12-06 04:06:37,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633631934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:37,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:37,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:06:37,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485577997] [2022-12-06 04:06:37,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:37,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:06:37,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:37,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:06:37,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:06:37,281 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2022-12-06 04:06:37,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 285 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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-12-06 04:06:37,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:37,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2022-12-06 04:06:37,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:37,691 INFO L130 PetriNetUnfolder]: 2063/3984 cut-off events. [2022-12-06 04:06:37,692 INFO L131 PetriNetUnfolder]: For 4864/4976 co-relation queries the response was YES. [2022-12-06 04:06:37,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11141 conditions, 3984 events. 2063/3984 cut-off events. For 4864/4976 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 28525 event pairs, 679 based on Foata normal form. 396/4109 useless extension candidates. Maximal degree in co-relation 8075. Up to 1658 conditions per place. [2022-12-06 04:06:37,716 INFO L137 encePairwiseOnDemand]: 44/51 looper letters, 65 selfloop transitions, 7 changer transitions 27/115 dead transitions. [2022-12-06 04:06:37,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 115 transitions, 701 flow [2022-12-06 04:06:37,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:06:37,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:06:37,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2022-12-06 04:06:37,718 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6715686274509803 [2022-12-06 04:06:37,718 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 285 flow. Second operand 4 states and 137 transitions. [2022-12-06 04:06:37,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 115 transitions, 701 flow [2022-12-06 04:06:37,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 115 transitions, 645 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:06:37,732 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 288 flow [2022-12-06 04:06:37,732 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2022-12-06 04:06:37,733 INFO L294 CegarLoopForPetriNet]: 52 programPoint places, 13 predicate places. [2022-12-06 04:06:37,733 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:37,733 INFO L89 Accepts]: Start accepts. Operand has 65 places, 59 transitions, 288 flow [2022-12-06 04:06:37,734 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:37,734 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:37,734 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 59 transitions, 288 flow [2022-12-06 04:06:37,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 59 transitions, 288 flow [2022-12-06 04:06:37,764 INFO L130 PetriNetUnfolder]: 62/447 cut-off events. [2022-12-06 04:06:37,764 INFO L131 PetriNetUnfolder]: For 405/457 co-relation queries the response was YES. [2022-12-06 04:06:37,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1119 conditions, 447 events. 62/447 cut-off events. For 405/457 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3471 event pairs, 2 based on Foata normal form. 1/411 useless extension candidates. Maximal degree in co-relation 1091. Up to 101 conditions per place. [2022-12-06 04:06:37,769 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 59 transitions, 288 flow [2022-12-06 04:06:37,769 INFO L188 LiptonReduction]: Number of co-enabled transitions 908 [2022-12-06 04:06:37,853 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:06:37,854 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-06 04:06:37,854 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 288 flow [2022-12-06 04:06:37,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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-12-06 04:06:37,854 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:37,855 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:37,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:06:37,855 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-12-06 04:06:37,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:37,855 INFO L85 PathProgramCache]: Analyzing trace with hash -271481486, now seen corresponding path program 1 times [2022-12-06 04:06:37,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:37,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643100476] [2022-12-06 04:06:37,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:37,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:37,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:37,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:37,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643100476] [2022-12-06 04:06:37,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643100476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:37,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:37,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:06:37,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930903230] [2022-12-06 04:06:37,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:37,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:06:37,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:37,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:06:37,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:06:37,918 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 47 [2022-12-06 04:06:37,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 288 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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-12-06 04:06:37,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:37,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 47 [2022-12-06 04:06:37,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:38,457 INFO L130 PetriNetUnfolder]: 2682/4714 cut-off events. [2022-12-06 04:06:38,457 INFO L131 PetriNetUnfolder]: For 6872/6872 co-relation queries the response was YES. [2022-12-06 04:06:38,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14825 conditions, 4714 events. 2682/4714 cut-off events. For 6872/6872 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 29520 event pairs, 439 based on Foata normal form. 0/4636 useless extension candidates. Maximal degree in co-relation 11531. Up to 1760 conditions per place. [2022-12-06 04:06:38,488 INFO L137 encePairwiseOnDemand]: 28/47 looper letters, 120 selfloop transitions, 32 changer transitions 23/177 dead transitions. [2022-12-06 04:06:38,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 177 transitions, 1199 flow [2022-12-06 04:06:38,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:06:38,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:06:38,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions. [2022-12-06 04:06:38,491 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4627659574468085 [2022-12-06 04:06:38,491 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 288 flow. Second operand 8 states and 174 transitions. [2022-12-06 04:06:38,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 177 transitions, 1199 flow [2022-12-06 04:06:38,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 177 transitions, 1185 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-06 04:06:38,509 INFO L231 Difference]: Finished difference. Result has 73 places, 81 transitions, 581 flow [2022-12-06 04:06:38,509 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=581, PETRI_PLACES=73, PETRI_TRANSITIONS=81} [2022-12-06 04:06:38,511 INFO L294 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2022-12-06 04:06:38,511 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:38,511 INFO L89 Accepts]: Start accepts. Operand has 73 places, 81 transitions, 581 flow [2022-12-06 04:06:38,512 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:38,512 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:38,513 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 81 transitions, 581 flow [2022-12-06 04:06:38,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 81 transitions, 581 flow [2022-12-06 04:06:38,559 INFO L130 PetriNetUnfolder]: 110/527 cut-off events. [2022-12-06 04:06:38,560 INFO L131 PetriNetUnfolder]: For 1224/1296 co-relation queries the response was YES. [2022-12-06 04:06:38,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1878 conditions, 527 events. 110/527 cut-off events. For 1224/1296 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3973 event pairs, 0 based on Foata normal form. 13/524 useless extension candidates. Maximal degree in co-relation 1843. Up to 150 conditions per place. [2022-12-06 04:06:38,566 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 81 transitions, 581 flow [2022-12-06 04:06:38,567 INFO L188 LiptonReduction]: Number of co-enabled transitions 986 [2022-12-06 04:06:38,626 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:06:38,635 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-06 04:06:38,635 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 80 transitions, 583 flow [2022-12-06 04:06:38,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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-12-06 04:06:38,635 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:38,635 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:38,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:06:38,636 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-12-06 04:06:38,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:38,636 INFO L85 PathProgramCache]: Analyzing trace with hash -378160099, now seen corresponding path program 1 times [2022-12-06 04:06:38,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:38,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547352746] [2022-12-06 04:06:38,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:38,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:38,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:38,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:38,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547352746] [2022-12-06 04:06:38,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547352746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:38,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:38,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:06:38,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809163765] [2022-12-06 04:06:38,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:38,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:06:38,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:38,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:06:38,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:06:38,710 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 46 [2022-12-06 04:06:38,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 80 transitions, 583 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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-12-06 04:06:38,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:38,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 46 [2022-12-06 04:06:38,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:39,251 INFO L130 PetriNetUnfolder]: 1963/3553 cut-off events. [2022-12-06 04:06:39,251 INFO L131 PetriNetUnfolder]: For 9021/9021 co-relation queries the response was YES. [2022-12-06 04:06:39,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13751 conditions, 3553 events. 1963/3553 cut-off events. For 9021/9021 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 22006 event pairs, 299 based on Foata normal form. 46/3599 useless extension candidates. Maximal degree in co-relation 11718. Up to 1341 conditions per place. [2022-12-06 04:06:39,278 INFO L137 encePairwiseOnDemand]: 27/46 looper letters, 118 selfloop transitions, 44 changer transitions 9/173 dead transitions. [2022-12-06 04:06:39,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 173 transitions, 1383 flow [2022-12-06 04:06:39,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:06:39,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:06:39,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 166 transitions. [2022-12-06 04:06:39,280 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45108695652173914 [2022-12-06 04:06:39,280 INFO L175 Difference]: Start difference. First operand has 70 places, 80 transitions, 583 flow. Second operand 8 states and 166 transitions. [2022-12-06 04:06:39,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 173 transitions, 1383 flow [2022-12-06 04:06:39,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 173 transitions, 1379 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-06 04:06:39,313 INFO L231 Difference]: Finished difference. Result has 80 places, 93 transitions, 829 flow [2022-12-06 04:06:39,313 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=829, PETRI_PLACES=80, PETRI_TRANSITIONS=93} [2022-12-06 04:06:39,315 INFO L294 CegarLoopForPetriNet]: 52 programPoint places, 28 predicate places. [2022-12-06 04:06:39,315 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:39,315 INFO L89 Accepts]: Start accepts. Operand has 80 places, 93 transitions, 829 flow [2022-12-06 04:06:39,317 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:39,317 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:39,318 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 93 transitions, 829 flow [2022-12-06 04:06:39,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 93 transitions, 829 flow [2022-12-06 04:06:39,370 INFO L130 PetriNetUnfolder]: 107/495 cut-off events. [2022-12-06 04:06:39,370 INFO L131 PetriNetUnfolder]: For 1788/1846 co-relation queries the response was YES. [2022-12-06 04:06:39,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2021 conditions, 495 events. 107/495 cut-off events. For 1788/1846 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3674 event pairs, 0 based on Foata normal form. 15/503 useless extension candidates. Maximal degree in co-relation 1981. Up to 129 conditions per place. [2022-12-06 04:06:39,378 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 93 transitions, 829 flow [2022-12-06 04:06:39,378 INFO L188 LiptonReduction]: Number of co-enabled transitions 1018 [2022-12-06 04:06:39,380 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [235] L732-->L735: Formula: (= |v_readerThread1of1ForFork3_~ly~0#1_1| v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~y~0=v_~y~0_2, readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_1|} AuxVars[] AssignedVars[readerThread1of1ForFork3_~ly~0#1] and [349] L717-1-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork1_#res#1.base_33| 0) (= |v_writerThread1of1ForFork1_#res#1.offset_33| 0) (= v_~w~0_340 0) (= 3 v_~x~0_176)) InVars {} OutVars{~w~0=v_~w~0_340, writerThread1of1ForFork1_#res#1.base=|v_writerThread1of1ForFork1_#res#1.base_33|, writerThread1of1ForFork1_#res#1.offset=|v_writerThread1of1ForFork1_#res#1.offset_33|, ~x~0=v_~x~0_176} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork1_#res#1.base, writerThread1of1ForFork1_#res#1.offset, ~x~0] [2022-12-06 04:06:39,406 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [235] L732-->L735: Formula: (= |v_readerThread1of1ForFork3_~ly~0#1_1| v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~y~0=v_~y~0_2, readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_1|} AuxVars[] AssignedVars[readerThread1of1ForFork3_~ly~0#1] and [220] L729-->L732: Formula: (= |v_readerThread1of1ForFork2_~l~0#1_5| v_~y~0_1) InVars {readerThread1of1ForFork2_~l~0#1=|v_readerThread1of1ForFork2_~l~0#1_5|} OutVars{~y~0=v_~y~0_1, readerThread1of1ForFork2_~l~0#1=|v_readerThread1of1ForFork2_~l~0#1_5|} AuxVars[] AssignedVars[~y~0] [2022-12-06 04:06:39,418 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [235] L732-->L735: Formula: (= |v_readerThread1of1ForFork3_~ly~0#1_1| v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~y~0=v_~y~0_2, readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_1|} AuxVars[] AssignedVars[readerThread1of1ForFork3_~ly~0#1] and [349] L717-1-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork1_#res#1.base_33| 0) (= |v_writerThread1of1ForFork1_#res#1.offset_33| 0) (= v_~w~0_340 0) (= 3 v_~x~0_176)) InVars {} OutVars{~w~0=v_~w~0_340, writerThread1of1ForFork1_#res#1.base=|v_writerThread1of1ForFork1_#res#1.base_33|, writerThread1of1ForFork1_#res#1.offset=|v_writerThread1of1ForFork1_#res#1.offset_33|, ~x~0=v_~x~0_176} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork1_#res#1.base, writerThread1of1ForFork1_#res#1.offset, ~x~0] [2022-12-06 04:06:39,447 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [235] L732-->L735: Formula: (= |v_readerThread1of1ForFork3_~ly~0#1_1| v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~y~0=v_~y~0_2, readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_1|} AuxVars[] AssignedVars[readerThread1of1ForFork3_~ly~0#1] and [344] L717-1-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork0_#res#1.base_33| 0) (= |v_writerThread1of1ForFork0_#res#1.offset_33| 0) (= 3 v_~x~0_157) (= v_~w~0_321 0)) InVars {} OutVars{~w~0=v_~w~0_321, writerThread1of1ForFork0_#res#1.base=|v_writerThread1of1ForFork0_#res#1.base_33|, ~x~0=v_~x~0_157, writerThread1of1ForFork0_#res#1.offset=|v_writerThread1of1ForFork0_#res#1.offset_33|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork0_#res#1.base, ~x~0, writerThread1of1ForFork0_#res#1.offset] [2022-12-06 04:06:39,474 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [235] L732-->L735: Formula: (= |v_readerThread1of1ForFork3_~ly~0#1_1| v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~y~0=v_~y~0_2, readerThread1of1ForFork3_~ly~0#1=|v_readerThread1of1ForFork3_~ly~0#1_1|} AuxVars[] AssignedVars[readerThread1of1ForFork3_~ly~0#1] and [344] L717-1-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork0_#res#1.base_33| 0) (= |v_writerThread1of1ForFork0_#res#1.offset_33| 0) (= 3 v_~x~0_157) (= v_~w~0_321 0)) InVars {} OutVars{~w~0=v_~w~0_321, writerThread1of1ForFork0_#res#1.base=|v_writerThread1of1ForFork0_#res#1.base_33|, ~x~0=v_~x~0_157, writerThread1of1ForFork0_#res#1.offset=|v_writerThread1of1ForFork0_#res#1.offset_33|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork0_#res#1.base, ~x~0, writerThread1of1ForFork0_#res#1.offset] [2022-12-06 04:06:39,529 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [221] L732-->L735: Formula: (= |v_readerThread1of1ForFork2_~ly~0#1_1| v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~y~0=v_~y~0_2, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_~ly~0#1] and [346] L717-1-->writerEXIT: Formula: (and (= 3 v_~x~0_170) (= |v_writerThread1of1ForFork1_#res#1.base_27| 0) (= |v_writerThread1of1ForFork1_#res#1.offset_27| 0) (= v_~w~0_334 0)) InVars {} OutVars{~w~0=v_~w~0_334, writerThread1of1ForFork1_#res#1.base=|v_writerThread1of1ForFork1_#res#1.base_27|, writerThread1of1ForFork1_#res#1.offset=|v_writerThread1of1ForFork1_#res#1.offset_27|, ~x~0=v_~x~0_170} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork1_#res#1.base, writerThread1of1ForFork1_#res#1.offset, ~x~0] [2022-12-06 04:06:39,556 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [221] L732-->L735: Formula: (= |v_readerThread1of1ForFork2_~ly~0#1_1| v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~y~0=v_~y~0_2, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_~ly~0#1] and [342] L717-1-->writerEXIT: Formula: (and (= v_~w~0_317 0) (= |v_writerThread1of1ForFork0_#res#1.base_29| 0) (= |v_writerThread1of1ForFork0_#res#1.offset_29| 0) (= 3 v_~x~0_153)) InVars {} OutVars{~w~0=v_~w~0_317, writerThread1of1ForFork0_#res#1.base=|v_writerThread1of1ForFork0_#res#1.base_29|, ~x~0=v_~x~0_153, writerThread1of1ForFork0_#res#1.offset=|v_writerThread1of1ForFork0_#res#1.offset_29|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork0_#res#1.base, ~x~0, writerThread1of1ForFork0_#res#1.offset] [2022-12-06 04:06:39,583 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:06:39,584 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 269 [2022-12-06 04:06:39,584 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 92 transitions, 855 flow [2022-12-06 04:06:39,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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-12-06 04:06:39,585 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:39,585 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:39,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:06:39,585 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-12-06 04:06:39,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:39,586 INFO L85 PathProgramCache]: Analyzing trace with hash -391970075, now seen corresponding path program 1 times [2022-12-06 04:06:39,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:39,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748430665] [2022-12-06 04:06:39,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:39,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:39,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:39,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748430665] [2022-12-06 04:06:39,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748430665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:39,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:39,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:06:39,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153175761] [2022-12-06 04:06:39,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:39,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:06:39,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:39,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:06:39,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:06:39,676 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 52 [2022-12-06 04:06:39,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 92 transitions, 855 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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-12-06 04:06:39,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:39,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 52 [2022-12-06 04:06:39,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:40,191 INFO L130 PetriNetUnfolder]: 1780/3237 cut-off events. [2022-12-06 04:06:40,191 INFO L131 PetriNetUnfolder]: For 11316/11316 co-relation queries the response was YES. [2022-12-06 04:06:40,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13655 conditions, 3237 events. 1780/3237 cut-off events. For 11316/11316 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 19939 event pairs, 357 based on Foata normal form. 54/3291 useless extension candidates. Maximal degree in co-relation 12076. Up to 1308 conditions per place. [2022-12-06 04:06:40,216 INFO L137 encePairwiseOnDemand]: 26/52 looper letters, 115 selfloop transitions, 49 changer transitions 10/176 dead transitions. [2022-12-06 04:06:40,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 176 transitions, 1614 flow [2022-12-06 04:06:40,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:06:40,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:06:40,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2022-12-06 04:06:40,218 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3870192307692308 [2022-12-06 04:06:40,218 INFO L175 Difference]: Start difference. First operand has 79 places, 92 transitions, 855 flow. Second operand 8 states and 161 transitions. [2022-12-06 04:06:40,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 176 transitions, 1614 flow [2022-12-06 04:06:40,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 176 transitions, 1571 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-06 04:06:40,266 INFO L231 Difference]: Finished difference. Result has 86 places, 101 transitions, 1046 flow [2022-12-06 04:06:40,266 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1046, PETRI_PLACES=86, PETRI_TRANSITIONS=101} [2022-12-06 04:06:40,267 INFO L294 CegarLoopForPetriNet]: 52 programPoint places, 34 predicate places. [2022-12-06 04:06:40,267 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:40,267 INFO L89 Accepts]: Start accepts. Operand has 86 places, 101 transitions, 1046 flow [2022-12-06 04:06:40,268 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:40,268 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:40,269 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 101 transitions, 1046 flow [2022-12-06 04:06:40,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 101 transitions, 1046 flow [2022-12-06 04:06:40,312 INFO L130 PetriNetUnfolder]: 112/491 cut-off events. [2022-12-06 04:06:40,312 INFO L131 PetriNetUnfolder]: For 2263/2306 co-relation queries the response was YES. [2022-12-06 04:06:40,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2222 conditions, 491 events. 112/491 cut-off events. For 2263/2306 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3551 event pairs, 0 based on Foata normal form. 7/490 useless extension candidates. Maximal degree in co-relation 2179. Up to 119 conditions per place. [2022-12-06 04:06:40,319 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 101 transitions, 1046 flow [2022-12-06 04:06:40,319 INFO L188 LiptonReduction]: Number of co-enabled transitions 1058 [2022-12-06 04:06:40,320 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [221] L732-->L735: Formula: (= |v_readerThread1of1ForFork2_~ly~0#1_1| v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~y~0=v_~y~0_2, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_~ly~0#1] and [234] L729-->L732: Formula: (= |v_readerThread1of1ForFork3_~l~0#1_5| v_~y~0_1) InVars {readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_5|} OutVars{~y~0=v_~y~0_1, readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_5|} AuxVars[] AssignedVars[~y~0] [2022-12-06 04:06:40,330 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [221] L732-->L735: Formula: (= |v_readerThread1of1ForFork2_~ly~0#1_1| v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~y~0=v_~y~0_2, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_~ly~0#1] and [339] L717-1-->writerEXIT: Formula: (and (= v_~w~0_311 0) (= |v_writerThread1of1ForFork0_#res#1.offset_23| 0) (= |v_writerThread1of1ForFork0_#res#1.base_23| 0) (= 3 v_~x~0_147)) InVars {} OutVars{~w~0=v_~w~0_311, writerThread1of1ForFork0_#res#1.base=|v_writerThread1of1ForFork0_#res#1.base_23|, ~x~0=v_~x~0_147, writerThread1of1ForFork0_#res#1.offset=|v_writerThread1of1ForFork0_#res#1.offset_23|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork0_#res#1.base, ~x~0, writerThread1of1ForFork0_#res#1.offset] [2022-12-06 04:06:40,351 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [221] L732-->L735: Formula: (= |v_readerThread1of1ForFork2_~ly~0#1_1| v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~y~0=v_~y~0_2, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_~ly~0#1] and [348] L717-1-->writerEXIT: Formula: (and (= v_~w~0_338 0) (= |v_writerThread1of1ForFork1_#res#1.offset_31| 0) (= |v_writerThread1of1ForFork1_#res#1.base_31| 0) (= 3 v_~x~0_174)) InVars {} OutVars{~w~0=v_~w~0_338, writerThread1of1ForFork1_#res#1.base=|v_writerThread1of1ForFork1_#res#1.base_31|, writerThread1of1ForFork1_#res#1.offset=|v_writerThread1of1ForFork1_#res#1.offset_31|, ~x~0=v_~x~0_174} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork1_#res#1.base, writerThread1of1ForFork1_#res#1.offset, ~x~0] [2022-12-06 04:06:40,378 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:06:40,379 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-06 04:06:40,379 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 101 transitions, 1058 flow [2022-12-06 04:06:40,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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-12-06 04:06:40,379 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:40,379 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:40,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:06:40,379 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-12-06 04:06:40,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:40,380 INFO L85 PathProgramCache]: Analyzing trace with hash 209047361, now seen corresponding path program 1 times [2022-12-06 04:06:40,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:40,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306304257] [2022-12-06 04:06:40,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:40,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:40,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:40,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:40,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306304257] [2022-12-06 04:06:40,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306304257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:40,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:40,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:06:40,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428464914] [2022-12-06 04:06:40,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:40,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:06:40,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:40,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:06:40,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:06:40,461 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2022-12-06 04:06:40,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 101 transitions, 1058 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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-12-06 04:06:40,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:40,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2022-12-06 04:06:40,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:40,735 INFO L130 PetriNetUnfolder]: 748/1926 cut-off events. [2022-12-06 04:06:40,736 INFO L131 PetriNetUnfolder]: For 9436/9661 co-relation queries the response was YES. [2022-12-06 04:06:40,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8809 conditions, 1926 events. 748/1926 cut-off events. For 9436/9661 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 14774 event pairs, 234 based on Foata normal form. 239/2151 useless extension candidates. Maximal degree in co-relation 7571. Up to 779 conditions per place. [2022-12-06 04:06:40,748 INFO L137 encePairwiseOnDemand]: 46/55 looper letters, 68 selfloop transitions, 7 changer transitions 27/122 dead transitions. [2022-12-06 04:06:40,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 122 transitions, 1222 flow [2022-12-06 04:06:40,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:06:40,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:06:40,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2022-12-06 04:06:40,749 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44363636363636366 [2022-12-06 04:06:40,749 INFO L175 Difference]: Start difference. First operand has 86 places, 101 transitions, 1058 flow. Second operand 5 states and 122 transitions. [2022-12-06 04:06:40,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 122 transitions, 1222 flow [2022-12-06 04:06:40,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 122 transitions, 1192 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 04:06:40,787 INFO L231 Difference]: Finished difference. Result has 88 places, 79 transitions, 749 flow [2022-12-06 04:06:40,787 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=749, PETRI_PLACES=88, PETRI_TRANSITIONS=79} [2022-12-06 04:06:40,788 INFO L294 CegarLoopForPetriNet]: 52 programPoint places, 36 predicate places. [2022-12-06 04:06:40,788 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:40,788 INFO L89 Accepts]: Start accepts. Operand has 88 places, 79 transitions, 749 flow [2022-12-06 04:06:40,790 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:40,790 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:40,790 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 79 transitions, 749 flow [2022-12-06 04:06:40,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 79 transitions, 749 flow [2022-12-06 04:06:40,818 INFO L130 PetriNetUnfolder]: 57/323 cut-off events. [2022-12-06 04:06:40,818 INFO L131 PetriNetUnfolder]: For 996/1016 co-relation queries the response was YES. [2022-12-06 04:06:40,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1412 conditions, 323 events. 57/323 cut-off events. For 996/1016 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2136 event pairs, 0 based on Foata normal form. 1/319 useless extension candidates. Maximal degree in co-relation 1368. Up to 94 conditions per place. [2022-12-06 04:06:40,822 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 79 transitions, 749 flow [2022-12-06 04:06:40,822 INFO L188 LiptonReduction]: Number of co-enabled transitions 802 [2022-12-06 04:06:40,859 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [234] L729-->L732: Formula: (= |v_readerThread1of1ForFork3_~l~0#1_5| v_~y~0_1) InVars {readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_5|} OutVars{~y~0=v_~y~0_1, readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_5|} AuxVars[] AssignedVars[~y~0] and [353] L717-1-->writerEXIT: Formula: (and (= v_~w~0_376 0) (= 3 v_~x~0_235) (= |v_writerThread1of1ForFork1_#res#1.base_37| 0) (= |v_writerThread1of1ForFork1_#res#1.offset_37| 0)) InVars {} OutVars{~w~0=v_~w~0_376, writerThread1of1ForFork1_#res#1.base=|v_writerThread1of1ForFork1_#res#1.base_37|, writerThread1of1ForFork1_#res#1.offset=|v_writerThread1of1ForFork1_#res#1.offset_37|, ~x~0=v_~x~0_235} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork1_#res#1.base, writerThread1of1ForFork1_#res#1.offset, ~x~0] [2022-12-06 04:06:40,916 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [234] L729-->L732: Formula: (= |v_readerThread1of1ForFork3_~l~0#1_5| v_~y~0_1) InVars {readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_5|} OutVars{~y~0=v_~y~0_1, readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_5|} AuxVars[] AssignedVars[~y~0] and [351] L717-1-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork0_#res#1.offset_68| 0) (= 3 v_~x~0_228) (= v_~w~0_372 0) (= |v_writerThread1of1ForFork0_#res#1.base_68| 0)) InVars {} OutVars{~w~0=v_~w~0_372, writerThread1of1ForFork0_#res#1.base=|v_writerThread1of1ForFork0_#res#1.base_68|, ~x~0=v_~x~0_228, writerThread1of1ForFork0_#res#1.offset=|v_writerThread1of1ForFork0_#res#1.offset_68|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork0_#res#1.base, ~x~0, writerThread1of1ForFork0_#res#1.offset] [2022-12-06 04:06:40,948 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [220] L729-->L732: Formula: (= |v_readerThread1of1ForFork2_~l~0#1_5| v_~y~0_1) InVars {readerThread1of1ForFork2_~l~0#1=|v_readerThread1of1ForFork2_~l~0#1_5|} OutVars{~y~0=v_~y~0_1, readerThread1of1ForFork2_~l~0#1=|v_readerThread1of1ForFork2_~l~0#1_5|} AuxVars[] AssignedVars[~y~0] and [346] L717-1-->writerEXIT: Formula: (and (= 3 v_~x~0_170) (= |v_writerThread1of1ForFork1_#res#1.base_27| 0) (= |v_writerThread1of1ForFork1_#res#1.offset_27| 0) (= v_~w~0_334 0)) InVars {} OutVars{~w~0=v_~w~0_334, writerThread1of1ForFork1_#res#1.base=|v_writerThread1of1ForFork1_#res#1.base_27|, writerThread1of1ForFork1_#res#1.offset=|v_writerThread1of1ForFork1_#res#1.offset_27|, ~x~0=v_~x~0_170} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork1_#res#1.base, writerThread1of1ForFork1_#res#1.offset, ~x~0] [2022-12-06 04:06:41,000 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [220] L729-->L732: Formula: (= |v_readerThread1of1ForFork2_~l~0#1_5| v_~y~0_1) InVars {readerThread1of1ForFork2_~l~0#1=|v_readerThread1of1ForFork2_~l~0#1_5|} OutVars{~y~0=v_~y~0_1, readerThread1of1ForFork2_~l~0#1=|v_readerThread1of1ForFork2_~l~0#1_5|} AuxVars[] AssignedVars[~y~0] and [342] L717-1-->writerEXIT: Formula: (and (= v_~w~0_317 0) (= |v_writerThread1of1ForFork0_#res#1.base_29| 0) (= |v_writerThread1of1ForFork0_#res#1.offset_29| 0) (= 3 v_~x~0_153)) InVars {} OutVars{~w~0=v_~w~0_317, writerThread1of1ForFork0_#res#1.base=|v_writerThread1of1ForFork0_#res#1.base_29|, ~x~0=v_~x~0_153, writerThread1of1ForFork0_#res#1.offset=|v_writerThread1of1ForFork0_#res#1.offset_29|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork0_#res#1.base, ~x~0, writerThread1of1ForFork0_#res#1.offset] [2022-12-06 04:06:41,184 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L726-1-->L729: Formula: (= |v_readerThread1of1ForFork2_~l~0#1_3| v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, readerThread1of1ForFork2_~l~0#1=|v_readerThread1of1ForFork2_~l~0#1_3|} AuxVars[] AssignedVars[readerThread1of1ForFork2_~l~0#1] and [349] L717-1-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork1_#res#1.base_33| 0) (= |v_writerThread1of1ForFork1_#res#1.offset_33| 0) (= v_~w~0_340 0) (= 3 v_~x~0_176)) InVars {} OutVars{~w~0=v_~w~0_340, writerThread1of1ForFork1_#res#1.base=|v_writerThread1of1ForFork1_#res#1.base_33|, writerThread1of1ForFork1_#res#1.offset=|v_writerThread1of1ForFork1_#res#1.offset_33|, ~x~0=v_~x~0_176} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork1_#res#1.base, writerThread1of1ForFork1_#res#1.offset, ~x~0] [2022-12-06 04:06:41,208 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L726-1-->L729: Formula: (= |v_readerThread1of1ForFork2_~l~0#1_3| v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, readerThread1of1ForFork2_~l~0#1=|v_readerThread1of1ForFork2_~l~0#1_3|} AuxVars[] AssignedVars[readerThread1of1ForFork2_~l~0#1] and [344] L717-1-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork0_#res#1.base_33| 0) (= |v_writerThread1of1ForFork0_#res#1.offset_33| 0) (= 3 v_~x~0_157) (= v_~w~0_321 0)) InVars {} OutVars{~w~0=v_~w~0_321, writerThread1of1ForFork0_#res#1.base=|v_writerThread1of1ForFork0_#res#1.base_33|, ~x~0=v_~x~0_157, writerThread1of1ForFork0_#res#1.offset=|v_writerThread1of1ForFork0_#res#1.offset_33|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork0_#res#1.base, ~x~0, writerThread1of1ForFork0_#res#1.offset] [2022-12-06 04:06:41,252 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [233] L726-1-->L729: Formula: (= |v_readerThread1of1ForFork3_~l~0#1_3| v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_3|, ~x~0=v_~x~0_1} AuxVars[] AssignedVars[readerThread1of1ForFork3_~l~0#1] and [343] L717-1-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork0_#res#1.offset_31| 0) (= |v_writerThread1of1ForFork0_#res#1.base_31| 0) (= 3 v_~x~0_155) (= v_~w~0_319 0)) InVars {} OutVars{~w~0=v_~w~0_319, writerThread1of1ForFork0_#res#1.base=|v_writerThread1of1ForFork0_#res#1.base_31|, ~x~0=v_~x~0_155, writerThread1of1ForFork0_#res#1.offset=|v_writerThread1of1ForFork0_#res#1.offset_31|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork0_#res#1.base, ~x~0, writerThread1of1ForFork0_#res#1.offset] [2022-12-06 04:06:41,276 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [233] L726-1-->L729: Formula: (= |v_readerThread1of1ForFork3_~l~0#1_3| v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_3|, ~x~0=v_~x~0_1} AuxVars[] AssignedVars[readerThread1of1ForFork3_~l~0#1] and [350] L717-1-->writerEXIT: Formula: (and (= 3 v_~x~0_178) (= v_~w~0_342 0) (= |v_writerThread1of1ForFork1_#res#1.offset_35| 0) (= |v_writerThread1of1ForFork1_#res#1.base_35| 0)) InVars {} OutVars{~w~0=v_~w~0_342, writerThread1of1ForFork1_#res#1.base=|v_writerThread1of1ForFork1_#res#1.base_35|, writerThread1of1ForFork1_#res#1.offset=|v_writerThread1of1ForFork1_#res#1.offset_35|, ~x~0=v_~x~0_178} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork1_#res#1.base, writerThread1of1ForFork1_#res#1.offset, ~x~0] [2022-12-06 04:06:41,314 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L726-1-->L729: Formula: (= |v_readerThread1of1ForFork2_~l~0#1_3| v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, readerThread1of1ForFork2_~l~0#1=|v_readerThread1of1ForFork2_~l~0#1_3|} AuxVars[] AssignedVars[readerThread1of1ForFork2_~l~0#1] and [339] L717-1-->writerEXIT: Formula: (and (= v_~w~0_311 0) (= |v_writerThread1of1ForFork0_#res#1.offset_23| 0) (= |v_writerThread1of1ForFork0_#res#1.base_23| 0) (= 3 v_~x~0_147)) InVars {} OutVars{~w~0=v_~w~0_311, writerThread1of1ForFork0_#res#1.base=|v_writerThread1of1ForFork0_#res#1.base_23|, ~x~0=v_~x~0_147, writerThread1of1ForFork0_#res#1.offset=|v_writerThread1of1ForFork0_#res#1.offset_23|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork0_#res#1.base, ~x~0, writerThread1of1ForFork0_#res#1.offset] [2022-12-06 04:06:41,338 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [219] L726-1-->L729: Formula: (= |v_readerThread1of1ForFork2_~l~0#1_3| v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, readerThread1of1ForFork2_~l~0#1=|v_readerThread1of1ForFork2_~l~0#1_3|} AuxVars[] AssignedVars[readerThread1of1ForFork2_~l~0#1] and [348] L717-1-->writerEXIT: Formula: (and (= v_~w~0_338 0) (= |v_writerThread1of1ForFork1_#res#1.offset_31| 0) (= |v_writerThread1of1ForFork1_#res#1.base_31| 0) (= 3 v_~x~0_174)) InVars {} OutVars{~w~0=v_~w~0_338, writerThread1of1ForFork1_#res#1.base=|v_writerThread1of1ForFork1_#res#1.base_31|, writerThread1of1ForFork1_#res#1.offset=|v_writerThread1of1ForFork1_#res#1.offset_31|, ~x~0=v_~x~0_174} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork1_#res#1.base, writerThread1of1ForFork1_#res#1.offset, ~x~0] [2022-12-06 04:06:41,369 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [233] L726-1-->L729: Formula: (= |v_readerThread1of1ForFork3_~l~0#1_3| v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_3|, ~x~0=v_~x~0_1} AuxVars[] AssignedVars[readerThread1of1ForFork3_~l~0#1] and [343] L717-1-->writerEXIT: Formula: (and (= |v_writerThread1of1ForFork0_#res#1.offset_31| 0) (= |v_writerThread1of1ForFork0_#res#1.base_31| 0) (= 3 v_~x~0_155) (= v_~w~0_319 0)) InVars {} OutVars{~w~0=v_~w~0_319, writerThread1of1ForFork0_#res#1.base=|v_writerThread1of1ForFork0_#res#1.base_31|, ~x~0=v_~x~0_155, writerThread1of1ForFork0_#res#1.offset=|v_writerThread1of1ForFork0_#res#1.offset_31|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork0_#res#1.base, ~x~0, writerThread1of1ForFork0_#res#1.offset] [2022-12-06 04:06:41,484 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [233] L726-1-->L729: Formula: (= |v_readerThread1of1ForFork3_~l~0#1_3| v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_3|, ~x~0=v_~x~0_1} AuxVars[] AssignedVars[readerThread1of1ForFork3_~l~0#1] and [350] L717-1-->writerEXIT: Formula: (and (= 3 v_~x~0_178) (= v_~w~0_342 0) (= |v_writerThread1of1ForFork1_#res#1.offset_35| 0) (= |v_writerThread1of1ForFork1_#res#1.base_35| 0)) InVars {} OutVars{~w~0=v_~w~0_342, writerThread1of1ForFork1_#res#1.base=|v_writerThread1of1ForFork1_#res#1.base_35|, writerThread1of1ForFork1_#res#1.offset=|v_writerThread1of1ForFork1_#res#1.offset_35|, ~x~0=v_~x~0_178} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork1_#res#1.base, writerThread1of1ForFork1_#res#1.offset, ~x~0] [2022-12-06 04:06:41,543 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 04:06:41,544 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 756 [2022-12-06 04:06:41,544 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 73 transitions, 755 flow [2022-12-06 04:06:41,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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-12-06 04:06:41,544 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:41,545 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:41,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:06:41,545 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-12-06 04:06:41,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:41,545 INFO L85 PathProgramCache]: Analyzing trace with hash -407022414, now seen corresponding path program 1 times [2022-12-06 04:06:41,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:41,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783758787] [2022-12-06 04:06:41,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:41,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:41,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:41,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:41,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783758787] [2022-12-06 04:06:41,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783758787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:41,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:41,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:06:41,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755487044] [2022-12-06 04:06:41,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:41,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:06:41,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:41,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:06:41,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:06:41,626 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2022-12-06 04:06:41,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 73 transitions, 755 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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-12-06 04:06:41,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:41,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2022-12-06 04:06:41,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:41,753 INFO L130 PetriNetUnfolder]: 306/768 cut-off events. [2022-12-06 04:06:41,753 INFO L131 PetriNetUnfolder]: For 4201/4201 co-relation queries the response was YES. [2022-12-06 04:06:41,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3391 conditions, 768 events. 306/768 cut-off events. For 4201/4201 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4286 event pairs, 100 based on Foata normal form. 22/790 useless extension candidates. Maximal degree in co-relation 3366. Up to 305 conditions per place. [2022-12-06 04:06:41,757 INFO L137 encePairwiseOnDemand]: 54/61 looper letters, 0 selfloop transitions, 0 changer transitions 65/65 dead transitions. [2022-12-06 04:06:41,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 65 transitions, 473 flow [2022-12-06 04:06:41,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:06:41,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:06:41,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-06 04:06:41,758 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3180327868852459 [2022-12-06 04:06:41,758 INFO L175 Difference]: Start difference. First operand has 77 places, 73 transitions, 755 flow. Second operand 5 states and 97 transitions. [2022-12-06 04:06:41,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 65 transitions, 473 flow [2022-12-06 04:06:41,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 65 transitions, 392 flow, removed 8 selfloop flow, removed 17 redundant places. [2022-12-06 04:06:41,769 INFO L231 Difference]: Finished difference. Result has 62 places, 0 transitions, 0 flow [2022-12-06 04:06:41,769 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=62, PETRI_TRANSITIONS=0} [2022-12-06 04:06:41,769 INFO L294 CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places. [2022-12-06 04:06:41,769 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:41,770 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 0 transitions, 0 flow [2022-12-06 04:06:41,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 04:06:41,770 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 04:06:41,770 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:06:41,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-06 04:06:41,770 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 04:06:41,770 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 04:06:41,771 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:41,771 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-06 04:06:41,771 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 04:06:41,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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-12-06 04:06:41,774 INFO L805 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 04:06:41,774 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2022-12-06 04:06:41,774 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 04:06:41,774 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 04:06:41,774 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 04:06:41,775 INFO L805 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-12-06 04:06:41,775 INFO L805 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 04:06:41,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:06:41,775 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:41,779 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:06:41,779 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:06:41,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:06:41 BasicIcfg [2022-12-06 04:06:41,781 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:06:41,782 INFO L158 Benchmark]: Toolchain (without parser) took 13594.64ms. Allocated memory was 209.7MB in the beginning and 939.5MB in the end (delta: 729.8MB). Free memory was 184.2MB in the beginning and 596.4MB in the end (delta: -412.2MB). Peak memory consumption was 318.6MB. Max. memory is 8.0GB. [2022-12-06 04:06:41,782 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 209.7MB. Free memory is still 185.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:06:41,782 INFO L158 Benchmark]: CACSL2BoogieTranslator took 515.10ms. Allocated memory is still 209.7MB. Free memory was 184.2MB in the beginning and 163.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-06 04:06:41,783 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.63ms. Allocated memory is still 209.7MB. Free memory was 163.2MB in the beginning and 161.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:06:41,783 INFO L158 Benchmark]: Boogie Preprocessor took 49.78ms. Allocated memory is still 209.7MB. Free memory was 161.1MB in the beginning and 159.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:06:41,783 INFO L158 Benchmark]: RCFGBuilder took 437.15ms. Allocated memory is still 209.7MB. Free memory was 159.5MB in the beginning and 142.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-06 04:06:41,783 INFO L158 Benchmark]: TraceAbstraction took 12537.90ms. Allocated memory was 209.7MB in the beginning and 939.5MB in the end (delta: 729.8MB). Free memory was 141.7MB in the beginning and 596.4MB in the end (delta: -454.7MB). Peak memory consumption was 275.6MB. Max. memory is 8.0GB. [2022-12-06 04:06:41,784 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.13ms. Allocated memory is still 209.7MB. Free memory is still 185.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 515.10ms. Allocated memory is still 209.7MB. Free memory was 184.2MB in the beginning and 163.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.63ms. Allocated memory is still 209.7MB. Free memory was 163.2MB in the beginning and 161.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.78ms. Allocated memory is still 209.7MB. Free memory was 161.1MB in the beginning and 159.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 437.15ms. Allocated memory is still 209.7MB. Free memory was 159.5MB in the beginning and 142.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 12537.90ms. Allocated memory was 209.7MB in the beginning and 939.5MB in the end (delta: 729.8MB). Free memory was 141.7MB in the beginning and 596.4MB in the end (delta: -454.7MB). Peak memory consumption was 275.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 102 PlacesBefore, 52 PlacesAfterwards, 91 TransitionsBefore, 41 TransitionsAfterwards, 2408 CoEnabledTransitionPairs, 5 FixpointIterations, 0 TrivialSequentialCompositions, 10 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 35 ConcurrentYvCompositions, 0 ChoiceCompositions, 64 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3173, independent: 2993, independent conditional: 2993, independent unconditional: 0, dependent: 180, dependent conditional: 180, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3173, independent: 2993, independent conditional: 0, independent unconditional: 2993, dependent: 180, dependent conditional: 0, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3173, independent: 2993, independent conditional: 0, independent unconditional: 2993, dependent: 180, dependent conditional: 0, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3173, independent: 2993, independent conditional: 0, independent unconditional: 2993, dependent: 180, dependent conditional: 0, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1731, independent: 1686, independent conditional: 0, independent unconditional: 1686, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1731, independent: 1629, independent conditional: 0, independent unconditional: 1629, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 102, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 152, independent: 91, independent conditional: 0, independent unconditional: 91, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3173, independent: 1307, independent conditional: 0, independent unconditional: 1307, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 1731, unknown conditional: 0, unknown unconditional: 1731] , Statistics on independence cache: Total cache size (in pairs): 2859, Positive cache size: 2814, Positive conditional cache size: 0, Positive unconditional cache size: 2814, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 1314 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 400, independent: 360, independent conditional: 360, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 400, independent: 360, independent conditional: 121, independent unconditional: 239, dependent: 40, dependent conditional: 12, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 400, independent: 360, independent conditional: 39, independent unconditional: 321, dependent: 40, dependent conditional: 12, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 400, independent: 360, independent conditional: 39, independent unconditional: 321, dependent: 40, dependent conditional: 12, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 78, independent: 65, independent conditional: 5, independent unconditional: 60, dependent: 13, dependent conditional: 7, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 78, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 13, dependent conditional: 7, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 15, dependent conditional: 6, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 400, independent: 295, independent conditional: 34, independent unconditional: 261, dependent: 27, dependent conditional: 5, dependent unconditional: 22, unknown: 78, unknown conditional: 12, unknown unconditional: 66] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 65, Positive conditional cache size: 5, Positive unconditional cache size: 60, Negative cache size: 13, Negative conditional cache size: 7, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 82, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 61 PlacesBefore, 61 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 1208 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 894, independent: 838, independent conditional: 838, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 894, independent: 838, independent conditional: 458, independent unconditional: 380, dependent: 56, dependent conditional: 16, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 903, independent: 838, independent conditional: 100, independent unconditional: 738, dependent: 65, dependent conditional: 16, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 903, independent: 838, independent conditional: 100, independent unconditional: 738, dependent: 65, dependent conditional: 16, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 77, independent: 61, independent conditional: 4, independent unconditional: 57, dependent: 16, dependent conditional: 9, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 77, independent: 61, independent conditional: 0, independent unconditional: 61, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 9, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 11, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 903, independent: 777, independent conditional: 96, independent unconditional: 681, dependent: 49, dependent conditional: 7, dependent unconditional: 42, unknown: 77, unknown conditional: 13, unknown unconditional: 64] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 138, Positive conditional cache size: 9, Positive unconditional cache size: 129, Negative cache size: 29, Negative conditional cache size: 16, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 367, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 63 PlacesBefore, 61 PlacesAfterwards, 59 TransitionsBefore, 57 TransitionsAfterwards, 908 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 331, independent: 309, independent conditional: 309, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 331, independent: 309, independent conditional: 50, independent unconditional: 259, dependent: 22, dependent conditional: 6, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 331, independent: 309, independent conditional: 50, independent unconditional: 259, dependent: 22, dependent conditional: 6, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 331, independent: 309, independent conditional: 50, independent unconditional: 259, dependent: 22, dependent conditional: 6, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 67, independent: 62, independent conditional: 14, independent unconditional: 48, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 67, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 331, independent: 247, independent conditional: 36, independent unconditional: 211, dependent: 17, dependent conditional: 6, dependent unconditional: 11, unknown: 67, unknown conditional: 14, unknown unconditional: 53] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 204, Positive conditional cache size: 23, Positive unconditional cache size: 181, Negative cache size: 34, Negative conditional cache size: 16, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 71 PlacesBefore, 70 PlacesAfterwards, 81 TransitionsBefore, 80 TransitionsAfterwards, 986 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 32, independent: 32, independent conditional: 15, independent unconditional: 17, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, independent: 32, independent conditional: 15, independent unconditional: 17, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, independent: 32, independent conditional: 15, independent unconditional: 17, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 5, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, independent: 19, independent conditional: 10, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 13, unknown conditional: 5, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 256, Positive cache size: 222, Positive conditional cache size: 28, Positive unconditional cache size: 194, Negative cache size: 34, Negative conditional cache size: 16, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 80 PlacesBefore, 79 PlacesAfterwards, 93 TransitionsBefore, 92 TransitionsAfterwards, 1018 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 149, independent: 149, independent conditional: 149, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 149, independent: 149, independent conditional: 149, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 149, independent: 149, independent conditional: 149, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 149, independent: 149, independent conditional: 149, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 149, independent: 124, independent conditional: 124, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 25, unknown conditional: 25, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 287, Positive cache size: 253, Positive conditional cache size: 54, Positive unconditional cache size: 199, Negative cache size: 34, Negative conditional cache size: 16, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 86 PlacesBefore, 86 PlacesAfterwards, 101 TransitionsBefore, 101 TransitionsAfterwards, 1058 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 54, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 291, Positive cache size: 257, Positive conditional cache size: 54, Positive unconditional cache size: 203, Negative cache size: 34, Negative conditional cache size: 16, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 87 PlacesBefore, 77 PlacesAfterwards, 79 TransitionsBefore, 73 TransitionsAfterwards, 802 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 246, independent: 246, independent conditional: 246, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 246, independent: 246, independent conditional: 180, independent unconditional: 66, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 246, independent: 246, independent conditional: 180, independent unconditional: 66, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 246, independent: 246, independent conditional: 180, independent unconditional: 66, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 41, independent: 41, independent conditional: 24, independent unconditional: 17, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 41, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 246, independent: 205, independent conditional: 156, independent unconditional: 49, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 41, unknown conditional: 24, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 344, Positive cache size: 310, Positive conditional cache size: 78, Positive unconditional cache size: 232, Negative cache size: 34, Negative conditional cache size: 16, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 344, Positive cache size: 310, Positive conditional cache size: 78, Positive unconditional cache size: 232, Negative cache size: 34, Negative conditional cache size: 16, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - 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, 132 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: 12.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 565 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 565 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1669 IncrementalHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 25 mSDtfsCounter, 1669 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1058occurred in iteration=6, InterpolantAutomatonStates: 49, 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.6s InterpolantComputationTime, 111 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 103 ConstructedInterpolants, 0 QuantifiedInterpolants, 213 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-12-06 04:06:41,805 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...