/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix036.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:52:01,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:52:01,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:52:01,188 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:52:01,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:52:01,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:52:01,193 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:52:01,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:52:01,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:52:01,203 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:52:01,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:52:01,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:52:01,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:52:01,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:52:01,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:52:01,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:52:01,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:52:01,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:52:01,212 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:52:01,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:52:01,216 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:52:01,217 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:52:01,218 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:52:01,218 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:52:01,223 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:52:01,223 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:52:01,224 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:52:01,225 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:52:01,225 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:52:01,226 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:52:01,226 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:52:01,227 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:52:01,228 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:52:01,228 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:52:01,229 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:52:01,229 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:52:01,229 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:52:01,230 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:52:01,230 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:52:01,230 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:52:01,231 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:52:01,234 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 11:52:01,257 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:52:01,258 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:52:01,259 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:52:01,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:52:01,259 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:52:01,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:52:01,260 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:52:01,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:52:01,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:52:01,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:52:01,261 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:52:01,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:52:01,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:52:01,261 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:52:01,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:52:01,261 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:52:01,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:52:01,261 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:52:01,261 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:52:01,262 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:52:01,262 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:52:01,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:52:01,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:52:01,262 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:52:01,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:52:01,262 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:52:01,262 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:52:01,262 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:52:01,262 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-13 11:52:01,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:52:01,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:52:01,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:52:01,515 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:52:01,515 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:52:01,516 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036.oepc.i [2022-12-13 11:52:02,425 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:52:02,661 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:52:02,661 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036.oepc.i [2022-12-13 11:52:02,672 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e0a09ecc/43ba337966914d4d932e72d3935d5dac/FLAG93d3229a1 [2022-12-13 11:52:02,682 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e0a09ecc/43ba337966914d4d932e72d3935d5dac [2022-12-13 11:52:02,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:52:02,685 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:52:02,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:52:02,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:52:02,688 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:52:02,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:52:02" (1/1) ... [2022-12-13 11:52:02,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18cbd0ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:02, skipping insertion in model container [2022-12-13 11:52:02,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:52:02" (1/1) ... [2022-12-13 11:52:02,695 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:52:02,756 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:52:02,893 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-wmm/mix036.oepc.i[945,958] [2022-12-13 11:52:03,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:52:03,106 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:52:03,115 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-wmm/mix036.oepc.i[945,958] [2022-12-13 11:52:03,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:03,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:03,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:52:03,194 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:52:03,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:03 WrapperNode [2022-12-13 11:52:03,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:52:03,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:52:03,196 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:52:03,197 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:52:03,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:03" (1/1) ... [2022-12-13 11:52:03,222 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:03" (1/1) ... [2022-12-13 11:52:03,251 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2022-12-13 11:52:03,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:52:03,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:52:03,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:52:03,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:52:03,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:03" (1/1) ... [2022-12-13 11:52:03,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:03" (1/1) ... [2022-12-13 11:52:03,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:03" (1/1) ... [2022-12-13 11:52:03,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:03" (1/1) ... [2022-12-13 11:52:03,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:03" (1/1) ... [2022-12-13 11:52:03,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:03" (1/1) ... [2022-12-13 11:52:03,279 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:03" (1/1) ... [2022-12-13 11:52:03,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:03" (1/1) ... [2022-12-13 11:52:03,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:52:03,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:52:03,297 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:52:03,297 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:52:03,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:03" (1/1) ... [2022-12-13 11:52:03,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:52:03,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:52:03,320 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-13 11:52:03,328 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-13 11:52:03,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:52:03,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:52:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:52:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:52:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:52:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:52:03,363 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:52:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:52:03,363 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:52:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:52:03,363 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:52:03,364 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 11:52:03,364 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 11:52:03,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:52:03,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:52:03,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:52:03,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:52:03,366 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 11:52:03,503 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:52:03,504 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:52:03,820 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:52:03,926 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:52:03,926 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:52:03,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:52:03 BoogieIcfgContainer [2022-12-13 11:52:03,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:52:03,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:52:03,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:52:03,932 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:52:03,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:52:02" (1/3) ... [2022-12-13 11:52:03,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4373838c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:52:03, skipping insertion in model container [2022-12-13 11:52:03,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:03" (2/3) ... [2022-12-13 11:52:03,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4373838c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:52:03, skipping insertion in model container [2022-12-13 11:52:03,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:52:03" (3/3) ... [2022-12-13 11:52:03,934 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036.oepc.i [2022-12-13 11:52:03,947 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:52:03,947 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:52:03,947 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:52:03,995 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:52:04,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 288 flow [2022-12-13 11:52:04,110 INFO L130 PetriNetUnfolder]: 2/130 cut-off events. [2022-12-13 11:52:04,110 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:52:04,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-13 11:52:04,136 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 134 transitions, 288 flow [2022-12-13 11:52:04,139 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 130 transitions, 272 flow [2022-12-13 11:52:04,141 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:04,175 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 130 transitions, 272 flow [2022-12-13 11:52:04,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 272 flow [2022-12-13 11:52:04,203 INFO L130 PetriNetUnfolder]: 2/130 cut-off events. [2022-12-13 11:52:04,203 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:52:04,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-13 11:52:04,206 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 130 transitions, 272 flow [2022-12-13 11:52:04,207 INFO L226 LiptonReduction]: Number of co-enabled transitions 3270 [2022-12-13 11:52:09,550 INFO L241 LiptonReduction]: Total number of compositions: 103 [2022-12-13 11:52:09,561 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:52:09,566 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;@26feb68b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:52:09,566 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 11:52:09,568 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 11:52:09,568 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:52:09,568 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:09,569 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 11:52:09,569 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:52:09,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:09,572 INFO L85 PathProgramCache]: Analyzing trace with hash 590087, now seen corresponding path program 1 times [2022-12-13 11:52:09,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:09,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493347842] [2022-12-13 11:52:09,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:09,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:09,851 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-13 11:52:09,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:09,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493347842] [2022-12-13 11:52:09,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493347842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:09,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:09,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:52:09,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585678529] [2022-12-13 11:52:09,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:09,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:52:09,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:09,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:52:09,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:52:09,874 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 83 [2022-12-13 11:52:09,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 83 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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-13 11:52:09,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:09,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 83 [2022-12-13 11:52:09,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:17,030 INFO L130 PetriNetUnfolder]: 78140/109544 cut-off events. [2022-12-13 11:52:17,030 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2022-12-13 11:52:17,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212558 conditions, 109544 events. 78140/109544 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 5021. Compared 798233 event pairs, 41427 based on Foata normal form. 0/67237 useless extension candidates. Maximal degree in co-relation 212546. Up to 86085 conditions per place. [2022-12-13 11:52:17,327 INFO L137 encePairwiseOnDemand]: 79/83 looper letters, 50 selfloop transitions, 2 changer transitions 71/139 dead transitions. [2022-12-13 11:52:17,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 139 transitions, 543 flow [2022-12-13 11:52:17,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:52:17,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:52:17,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2022-12-13 11:52:17,339 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7068273092369478 [2022-12-13 11:52:17,340 INFO L175 Difference]: Start difference. First operand has 96 places, 83 transitions, 178 flow. Second operand 3 states and 176 transitions. [2022-12-13 11:52:17,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 139 transitions, 543 flow [2022-12-13 11:52:17,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 139 transitions, 536 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 11:52:17,347 INFO L231 Difference]: Finished difference. Result has 92 places, 45 transitions, 102 flow [2022-12-13 11:52:17,349 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=92, PETRI_TRANSITIONS=45} [2022-12-13 11:52:17,353 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -4 predicate places. [2022-12-13 11:52:17,353 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:17,354 INFO L89 Accepts]: Start accepts. Operand has 92 places, 45 transitions, 102 flow [2022-12-13 11:52:17,357 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:17,357 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:17,358 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 45 transitions, 102 flow [2022-12-13 11:52:17,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 45 transitions, 102 flow [2022-12-13 11:52:17,373 INFO L130 PetriNetUnfolder]: 0/45 cut-off events. [2022-12-13 11:52:17,373 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:52:17,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 45 events. 0/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 11:52:17,377 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 45 transitions, 102 flow [2022-12-13 11:52:17,377 INFO L226 LiptonReduction]: Number of co-enabled transitions 1210 [2022-12-13 11:52:17,526 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:52:17,528 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-13 11:52:17,528 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 102 flow [2022-12-13 11:52:17,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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-13 11:52:17,528 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:17,528 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:17,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:52:17,531 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:52:17,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:17,532 INFO L85 PathProgramCache]: Analyzing trace with hash -902204320, now seen corresponding path program 1 times [2022-12-13 11:52:17,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:17,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408722418] [2022-12-13 11:52:17,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:17,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:17,918 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-13 11:52:17,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:17,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408722418] [2022-12-13 11:52:17,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408722418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:17,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:17,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:52:17,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633951883] [2022-12-13 11:52:17,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:17,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:52:17,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:17,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:52:17,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:52:17,921 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2022-12-13 11:52:17,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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-13 11:52:17,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:17,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2022-12-13 11:52:17,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:20,197 INFO L130 PetriNetUnfolder]: 28547/39319 cut-off events. [2022-12-13 11:52:20,197 INFO L131 PetriNetUnfolder]: For 1513/1513 co-relation queries the response was YES. [2022-12-13 11:52:20,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79035 conditions, 39319 events. 28547/39319 cut-off events. For 1513/1513 co-relation queries the response was YES. Maximal size of possible extension queue 1241. Compared 226852 event pairs, 14531 based on Foata normal form. 0/30901 useless extension candidates. Maximal degree in co-relation 79025. Up to 37337 conditions per place. [2022-12-13 11:52:20,393 INFO L137 encePairwiseOnDemand]: 39/45 looper letters, 45 selfloop transitions, 5 changer transitions 2/63 dead transitions. [2022-12-13 11:52:20,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 63 transitions, 250 flow [2022-12-13 11:52:20,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:52:20,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:52:20,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2022-12-13 11:52:20,395 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6370370370370371 [2022-12-13 11:52:20,395 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 102 flow. Second operand 3 states and 86 transitions. [2022-12-13 11:52:20,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 63 transitions, 250 flow [2022-12-13 11:52:20,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 63 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:52:20,397 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 129 flow [2022-12-13 11:52:20,397 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2022-12-13 11:52:20,397 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -39 predicate places. [2022-12-13 11:52:20,398 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:20,398 INFO L89 Accepts]: Start accepts. Operand has 57 places, 48 transitions, 129 flow [2022-12-13 11:52:20,398 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:20,398 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:20,399 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 48 transitions, 129 flow [2022-12-13 11:52:20,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 48 transitions, 129 flow [2022-12-13 11:52:20,415 INFO L130 PetriNetUnfolder]: 45/212 cut-off events. [2022-12-13 11:52:20,416 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:52:20,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 212 events. 45/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1149 event pairs, 23 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 295. Up to 76 conditions per place. [2022-12-13 11:52:20,419 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 48 transitions, 129 flow [2022-12-13 11:52:20,419 INFO L226 LiptonReduction]: Number of co-enabled transitions 1238 [2022-12-13 11:52:20,487 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:52:20,488 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-13 11:52:20,489 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 129 flow [2022-12-13 11:52:20,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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-13 11:52:20,492 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:20,496 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:20,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:52:20,497 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:52:20,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:20,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1061971029, now seen corresponding path program 1 times [2022-12-13 11:52:20,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:20,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360712258] [2022-12-13 11:52:20,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:20,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:20,720 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-13 11:52:20,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:20,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360712258] [2022-12-13 11:52:20,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360712258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:20,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:20,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:52:20,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884590270] [2022-12-13 11:52:20,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:20,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:52:20,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:20,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:52:20,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:52:20,724 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2022-12-13 11:52:20,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 129 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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-13 11:52:20,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:20,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2022-12-13 11:52:20,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:22,387 INFO L130 PetriNetUnfolder]: 20543/28414 cut-off events. [2022-12-13 11:52:22,388 INFO L131 PetriNetUnfolder]: For 3908/3908 co-relation queries the response was YES. [2022-12-13 11:52:22,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61529 conditions, 28414 events. 20543/28414 cut-off events. For 3908/3908 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 155276 event pairs, 7135 based on Foata normal form. 624/24152 useless extension candidates. Maximal degree in co-relation 61518. Up to 18145 conditions per place. [2022-12-13 11:52:22,543 INFO L137 encePairwiseOnDemand]: 41/44 looper letters, 50 selfloop transitions, 3 changer transitions 1/65 dead transitions. [2022-12-13 11:52:22,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 65 transitions, 277 flow [2022-12-13 11:52:22,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:52:22,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:52:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-12-13 11:52:22,545 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2022-12-13 11:52:22,545 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 129 flow. Second operand 3 states and 84 transitions. [2022-12-13 11:52:22,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 65 transitions, 277 flow [2022-12-13 11:52:22,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 65 transitions, 272 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:52:22,547 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 133 flow [2022-12-13 11:52:22,547 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2022-12-13 11:52:22,547 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -38 predicate places. [2022-12-13 11:52:22,547 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:22,547 INFO L89 Accepts]: Start accepts. Operand has 58 places, 47 transitions, 133 flow [2022-12-13 11:52:22,548 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:22,548 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:22,548 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 47 transitions, 133 flow [2022-12-13 11:52:22,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 47 transitions, 133 flow [2022-12-13 11:52:22,556 INFO L130 PetriNetUnfolder]: 29/137 cut-off events. [2022-12-13 11:52:22,556 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-13 11:52:22,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 137 events. 29/137 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 661 event pairs, 11 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 217. Up to 53 conditions per place. [2022-12-13 11:52:22,558 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 47 transitions, 133 flow [2022-12-13 11:52:22,558 INFO L226 LiptonReduction]: Number of co-enabled transitions 1178 [2022-12-13 11:52:22,567 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:52:22,568 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 11:52:22,568 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 133 flow [2022-12-13 11:52:22,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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-13 11:52:22,568 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:22,569 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:22,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:52:22,569 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:52:22,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:22,569 INFO L85 PathProgramCache]: Analyzing trace with hash 563957993, now seen corresponding path program 1 times [2022-12-13 11:52:22,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:22,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807447636] [2022-12-13 11:52:22,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:22,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:22,692 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-13 11:52:22,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:22,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807447636] [2022-12-13 11:52:22,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807447636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:22,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:22,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:52:22,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192490055] [2022-12-13 11:52:22,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:22,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:52:22,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:22,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:52:22,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:52:22,697 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 11:52:22,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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-13 11:52:22,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:22,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 11:52:22,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:24,914 INFO L130 PetriNetUnfolder]: 23709/32946 cut-off events. [2022-12-13 11:52:24,915 INFO L131 PetriNetUnfolder]: For 3844/3961 co-relation queries the response was YES. [2022-12-13 11:52:24,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70538 conditions, 32946 events. 23709/32946 cut-off events. For 3844/3961 co-relation queries the response was YES. Maximal size of possible extension queue 1392. Compared 196645 event pairs, 7283 based on Foata normal form. 189/22754 useless extension candidates. Maximal degree in co-relation 70525. Up to 31507 conditions per place. [2022-12-13 11:52:25,051 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 46 selfloop transitions, 13 changer transitions 0/74 dead transitions. [2022-12-13 11:52:25,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 311 flow [2022-12-13 11:52:25,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:52:25,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:52:25,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-12-13 11:52:25,052 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7209302325581395 [2022-12-13 11:52:25,052 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 133 flow. Second operand 3 states and 93 transitions. [2022-12-13 11:52:25,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 311 flow [2022-12-13 11:52:25,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 74 transitions, 305 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:52:25,059 INFO L231 Difference]: Finished difference. Result has 58 places, 59 transitions, 216 flow [2022-12-13 11:52:25,059 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=58, PETRI_TRANSITIONS=59} [2022-12-13 11:52:25,060 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -38 predicate places. [2022-12-13 11:52:25,060 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:25,060 INFO L89 Accepts]: Start accepts. Operand has 58 places, 59 transitions, 216 flow [2022-12-13 11:52:25,061 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:25,061 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:25,061 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 59 transitions, 216 flow [2022-12-13 11:52:25,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 59 transitions, 216 flow [2022-12-13 11:52:25,222 INFO L130 PetriNetUnfolder]: 2897/4654 cut-off events. [2022-12-13 11:52:25,222 INFO L131 PetriNetUnfolder]: For 204/225 co-relation queries the response was YES. [2022-12-13 11:52:25,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9266 conditions, 4654 events. 2897/4654 cut-off events. For 204/225 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 33788 event pairs, 1536 based on Foata normal form. 0/2094 useless extension candidates. Maximal degree in co-relation 9255. Up to 3925 conditions per place. [2022-12-13 11:52:25,256 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 59 transitions, 216 flow [2022-12-13 11:52:25,256 INFO L226 LiptonReduction]: Number of co-enabled transitions 1450 [2022-12-13 11:52:25,284 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:52:25,285 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 225 [2022-12-13 11:52:25,285 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 59 transitions, 216 flow [2022-12-13 11:52:25,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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-13 11:52:25,285 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:25,285 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:25,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:52:25,286 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:52:25,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:25,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1284201677, now seen corresponding path program 1 times [2022-12-13 11:52:25,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:25,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679179439] [2022-12-13 11:52:25,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:25,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:25,430 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-13 11:52:25,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:25,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679179439] [2022-12-13 11:52:25,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679179439] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:25,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:25,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:52:25,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680142764] [2022-12-13 11:52:25,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:25,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:52:25,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:25,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:52:25,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:52:25,434 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 11:52:25,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 59 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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-13 11:52:25,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:25,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 11:52:25,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:26,889 INFO L130 PetriNetUnfolder]: 15180/22389 cut-off events. [2022-12-13 11:52:26,890 INFO L131 PetriNetUnfolder]: For 3309/3318 co-relation queries the response was YES. [2022-12-13 11:52:26,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60344 conditions, 22389 events. 15180/22389 cut-off events. For 3309/3318 co-relation queries the response was YES. Maximal size of possible extension queue 1038. Compared 142631 event pairs, 2609 based on Foata normal form. 702/16174 useless extension candidates. Maximal degree in co-relation 60330. Up to 18343 conditions per place. [2022-12-13 11:52:26,969 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 59 selfloop transitions, 25 changer transitions 0/99 dead transitions. [2022-12-13 11:52:26,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 99 transitions, 498 flow [2022-12-13 11:52:26,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:52:26,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:52:26,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2022-12-13 11:52:26,971 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.75 [2022-12-13 11:52:26,971 INFO L175 Difference]: Start difference. First operand has 58 places, 59 transitions, 216 flow. Second operand 4 states and 129 transitions. [2022-12-13 11:52:26,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 99 transitions, 498 flow [2022-12-13 11:52:26,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 99 transitions, 485 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:52:26,974 INFO L231 Difference]: Finished difference. Result has 61 places, 71 transitions, 351 flow [2022-12-13 11:52:26,974 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=351, PETRI_PLACES=61, PETRI_TRANSITIONS=71} [2022-12-13 11:52:26,975 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -35 predicate places. [2022-12-13 11:52:26,975 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:26,975 INFO L89 Accepts]: Start accepts. Operand has 61 places, 71 transitions, 351 flow [2022-12-13 11:52:26,975 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:26,976 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:26,976 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 71 transitions, 351 flow [2022-12-13 11:52:26,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 71 transitions, 351 flow [2022-12-13 11:52:27,115 INFO L130 PetriNetUnfolder]: 2168/3778 cut-off events. [2022-12-13 11:52:27,116 INFO L131 PetriNetUnfolder]: For 393/1062 co-relation queries the response was YES. [2022-12-13 11:52:27,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10900 conditions, 3778 events. 2168/3778 cut-off events. For 393/1062 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 28338 event pairs, 627 based on Foata normal form. 11/1823 useless extension candidates. Maximal degree in co-relation 10887. Up to 3124 conditions per place. [2022-12-13 11:52:27,141 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 71 transitions, 351 flow [2022-12-13 11:52:27,141 INFO L226 LiptonReduction]: Number of co-enabled transitions 1834 [2022-12-13 11:52:27,162 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:52:27,163 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-13 11:52:27,163 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 71 transitions, 351 flow [2022-12-13 11:52:27,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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-13 11:52:27,163 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:27,163 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:27,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:52:27,163 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:52:27,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:27,164 INFO L85 PathProgramCache]: Analyzing trace with hash 381878568, now seen corresponding path program 1 times [2022-12-13 11:52:27,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:27,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763705062] [2022-12-13 11:52:27,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:27,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:27,515 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-13 11:52:27,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:27,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763705062] [2022-12-13 11:52:27,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763705062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:27,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:27,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:52:27,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420143806] [2022-12-13 11:52:27,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:27,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:52:27,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:27,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:52:27,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:52:27,519 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2022-12-13 11:52:27,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 71 transitions, 351 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 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-13 11:52:27,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:27,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2022-12-13 11:52:27,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:30,197 INFO L130 PetriNetUnfolder]: 27416/42215 cut-off events. [2022-12-13 11:52:30,197 INFO L131 PetriNetUnfolder]: For 22720/28570 co-relation queries the response was YES. [2022-12-13 11:52:30,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135360 conditions, 42215 events. 27416/42215 cut-off events. For 22720/28570 co-relation queries the response was YES. Maximal size of possible extension queue 2306. Compared 326371 event pairs, 8104 based on Foata normal form. 1767/35758 useless extension candidates. Maximal degree in co-relation 135344. Up to 23442 conditions per place. [2022-12-13 11:52:30,502 INFO L137 encePairwiseOnDemand]: 35/43 looper letters, 155 selfloop transitions, 16 changer transitions 4/202 dead transitions. [2022-12-13 11:52:30,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 202 transitions, 1391 flow [2022-12-13 11:52:30,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:52:30,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:52:30,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2022-12-13 11:52:30,504 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7558139534883721 [2022-12-13 11:52:30,504 INFO L175 Difference]: Start difference. First operand has 61 places, 71 transitions, 351 flow. Second operand 6 states and 195 transitions. [2022-12-13 11:52:30,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 202 transitions, 1391 flow [2022-12-13 11:52:30,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 202 transitions, 1229 flow, removed 40 selfloop flow, removed 2 redundant places. [2022-12-13 11:52:30,517 INFO L231 Difference]: Finished difference. Result has 67 places, 90 transitions, 411 flow [2022-12-13 11:52:30,517 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=411, PETRI_PLACES=67, PETRI_TRANSITIONS=90} [2022-12-13 11:52:30,519 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -29 predicate places. [2022-12-13 11:52:30,519 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:30,519 INFO L89 Accepts]: Start accepts. Operand has 67 places, 90 transitions, 411 flow [2022-12-13 11:52:30,520 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:30,521 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:30,521 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 90 transitions, 411 flow [2022-12-13 11:52:30,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 90 transitions, 411 flow [2022-12-13 11:52:31,256 INFO L130 PetriNetUnfolder]: 9130/15890 cut-off events. [2022-12-13 11:52:31,256 INFO L131 PetriNetUnfolder]: For 5459/9218 co-relation queries the response was YES. [2022-12-13 11:52:31,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44457 conditions, 15890 events. 9130/15890 cut-off events. For 5459/9218 co-relation queries the response was YES. Maximal size of possible extension queue 2147. Compared 145746 event pairs, 2773 based on Foata normal form. 42/7887 useless extension candidates. Maximal degree in co-relation 44442. Up to 11926 conditions per place. [2022-12-13 11:52:31,409 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 90 transitions, 411 flow [2022-12-13 11:52:31,409 INFO L226 LiptonReduction]: Number of co-enabled transitions 2876 [2022-12-13 11:52:31,541 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] L833-->L849: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_56 256) 0)) (.cse9 (= (mod v_~b$r_buff0_thd4~0_58 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~b$w_buff0_used~0_140 256) 0)) (.cse5 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse9)) (.cse6 (and .cse4 .cse9))) (let ((.cse7 (or .cse11 .cse5 .cse6)) (.cse8 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse1 (= (mod v_~b$w_buff0_used~0_139 256) 0))) (and (= v_~b$r_buff1_thd4~0_55 (ite .cse0 v_~b$r_buff1_thd4~0_56 (ite (let ((.cse3 (= (mod v_~b$r_buff0_thd4~0_57 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse4 .cse3))) v_~b$r_buff1_thd4~0_56 0))) (= v_~b$flush_delayed~0_23 0) (= v_~b~0_98 (ite .cse0 v_~b$mem_tmp~0_16 v_~__unbuffered_p3_EBX~0_14)) (= v_~b$mem_tmp~0_16 v_~b~0_99) (= v_~b$w_buff1_used~0_126 (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse5 .cse6) v_~b$w_buff1_used~0_127 0))) (= (ite .cse7 v_~b~0_99 (ite .cse8 v_~b$w_buff0~0_63 v_~b$w_buff1~0_54)) v_~__unbuffered_p3_EBX~0_14) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~b$w_buff0~0_63 v_~b$w_buff0~0_62) (= v_~b$w_buff0_used~0_139 (ite .cse0 v_~b$w_buff0_used~0_140 (ite .cse7 v_~b$w_buff0_used~0_140 (ite .cse8 0 v_~b$w_buff0_used~0_140)))) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= (ite .cse0 v_~b$r_buff0_thd4~0_58 (ite (or .cse1 (and .cse2 .cse9) .cse6) v_~b$r_buff0_thd4~0_58 (ite (and .cse10 (not .cse1)) 0 v_~b$r_buff0_thd4~0_58))) v_~b$r_buff0_thd4~0_57) (= v_~b$w_buff1~0_54 v_~b$w_buff1~0_53))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_140, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~b~0=v_~b~0_99, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_56, ~b$w_buff1~0=v_~b$w_buff1~0_54, ~b$w_buff0~0=v_~b$w_buff0~0_63, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_58, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_16, ~b$flush_delayed~0=v_~b$flush_delayed~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_139, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_98, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_55, ~b$w_buff1~0=v_~b$w_buff1~0_53, ~b$w_buff0~0=v_~b$w_buff0~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_57} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3] and [509] L2-1-->L891: Formula: (let ((.cse2 (not (= (mod v_~b$w_buff0_used~0_221 256) 0))) (.cse3 (not (= (mod v_~b$r_buff1_thd0~0_42 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd0~0_44 256) 0)))) (let ((.cse0 (and (not (= (mod v_~b$w_buff0_used~0_222 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~b$w_buff1_used~0_197 256) 0)))) (.cse4 (and .cse2 .cse5))) (and (= (ite .cse0 v_~b$w_buff0~0_118 (ite .cse1 v_~b$w_buff1~0_101 v_~b~0_161)) v_~b~0_160) (= v_~b$w_buff0_used~0_221 (ite .cse0 0 v_~b$w_buff0_used~0_222)) (= v_~b$r_buff1_thd0~0_41 (ite (or (and .cse2 (not (= (mod v_~b$r_buff0_thd0~0_43 256) 0))) (and .cse3 (not (= (mod v_~b$w_buff1_used~0_196 256) 0)))) 0 v_~b$r_buff1_thd0~0_42)) (= (ite .cse4 0 v_~b$r_buff0_thd0~0_44) v_~b$r_buff0_thd0~0_43) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_197) v_~b$w_buff1_used~0_196)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_222, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_42, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_197, ~b~0=v_~b~0_161, ~b$w_buff1~0=v_~b$w_buff1~0_101, ~b$w_buff0~0=v_~b$w_buff0~0_118, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_44} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_221, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_41, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_196, ~b~0=v_~b~0_160, ~b$w_buff1~0=v_~b$w_buff1~0_101, ~b$w_buff0~0=v_~b$w_buff0~0_118, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_43} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff1_thd0~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff0_thd0~0] [2022-12-13 11:52:31,762 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] L833-->L849: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_56 256) 0)) (.cse9 (= (mod v_~b$r_buff0_thd4~0_58 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~b$w_buff0_used~0_140 256) 0)) (.cse5 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse9)) (.cse6 (and .cse4 .cse9))) (let ((.cse7 (or .cse11 .cse5 .cse6)) (.cse8 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse1 (= (mod v_~b$w_buff0_used~0_139 256) 0))) (and (= v_~b$r_buff1_thd4~0_55 (ite .cse0 v_~b$r_buff1_thd4~0_56 (ite (let ((.cse3 (= (mod v_~b$r_buff0_thd4~0_57 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse4 .cse3))) v_~b$r_buff1_thd4~0_56 0))) (= v_~b$flush_delayed~0_23 0) (= v_~b~0_98 (ite .cse0 v_~b$mem_tmp~0_16 v_~__unbuffered_p3_EBX~0_14)) (= v_~b$mem_tmp~0_16 v_~b~0_99) (= v_~b$w_buff1_used~0_126 (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse5 .cse6) v_~b$w_buff1_used~0_127 0))) (= (ite .cse7 v_~b~0_99 (ite .cse8 v_~b$w_buff0~0_63 v_~b$w_buff1~0_54)) v_~__unbuffered_p3_EBX~0_14) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~b$w_buff0~0_63 v_~b$w_buff0~0_62) (= v_~b$w_buff0_used~0_139 (ite .cse0 v_~b$w_buff0_used~0_140 (ite .cse7 v_~b$w_buff0_used~0_140 (ite .cse8 0 v_~b$w_buff0_used~0_140)))) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= (ite .cse0 v_~b$r_buff0_thd4~0_58 (ite (or .cse1 (and .cse2 .cse9) .cse6) v_~b$r_buff0_thd4~0_58 (ite (and .cse10 (not .cse1)) 0 v_~b$r_buff0_thd4~0_58))) v_~b$r_buff0_thd4~0_57) (= v_~b$w_buff1~0_54 v_~b$w_buff1~0_53))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_140, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~b~0=v_~b~0_99, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_56, ~b$w_buff1~0=v_~b$w_buff1~0_54, ~b$w_buff0~0=v_~b$w_buff0~0_63, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_58, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_16, ~b$flush_delayed~0=v_~b$flush_delayed~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_139, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_98, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_55, ~b$w_buff1~0=v_~b$w_buff1~0_53, ~b$w_buff0~0=v_~b$w_buff0~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_57} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3] and [401] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~b$w_buff0_used~0_95 256) 0))) (.cse3 (not (= (mod v_~b$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd3~0_20 256) 0)))) (let ((.cse1 (and .cse5 (not (= (mod v_~b$w_buff0_used~0_96 256) 0)))) (.cse2 (and (not (= (mod v_~b$w_buff1_used~0_83 256) 0)) .cse3)) (.cse0 (and .cse5 .cse4))) (and (= (ite .cse0 0 v_~b$r_buff0_thd3~0_20) v_~b$r_buff0_thd3~0_19) (= (ite .cse1 v_~b$w_buff0~0_38 (ite .cse2 v_~b$w_buff1~0_31 v_~b~0_59)) v_~b~0_58) (= v_~b$w_buff0_used~0_95 (ite .cse1 0 v_~b$w_buff0_used~0_96)) (= (ite (or (and (not (= (mod v_~b$w_buff1_used~0_82 256) 0)) .cse3) (and .cse4 (not (= (mod v_~b$r_buff0_thd3~0_19 256) 0)))) 0 v_~b$r_buff1_thd3~0_18) v_~b$r_buff1_thd3~0_17) (= (ite (or .cse2 .cse0) 0 v_~b$w_buff1_used~0_83) v_~b$w_buff1_used~0_82)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_96, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_20, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_83, ~b~0=v_~b~0_59, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_38, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_18} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_95, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_19, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_82, ~b~0=v_~b~0_58, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_38, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_17} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd3~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd3~0] [2022-12-13 11:52:31,975 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] L833-->L849: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_56 256) 0)) (.cse9 (= (mod v_~b$r_buff0_thd4~0_58 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~b$w_buff0_used~0_140 256) 0)) (.cse5 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse9)) (.cse6 (and .cse4 .cse9))) (let ((.cse7 (or .cse11 .cse5 .cse6)) (.cse8 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse1 (= (mod v_~b$w_buff0_used~0_139 256) 0))) (and (= v_~b$r_buff1_thd4~0_55 (ite .cse0 v_~b$r_buff1_thd4~0_56 (ite (let ((.cse3 (= (mod v_~b$r_buff0_thd4~0_57 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse4 .cse3))) v_~b$r_buff1_thd4~0_56 0))) (= v_~b$flush_delayed~0_23 0) (= v_~b~0_98 (ite .cse0 v_~b$mem_tmp~0_16 v_~__unbuffered_p3_EBX~0_14)) (= v_~b$mem_tmp~0_16 v_~b~0_99) (= v_~b$w_buff1_used~0_126 (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse5 .cse6) v_~b$w_buff1_used~0_127 0))) (= (ite .cse7 v_~b~0_99 (ite .cse8 v_~b$w_buff0~0_63 v_~b$w_buff1~0_54)) v_~__unbuffered_p3_EBX~0_14) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~b$w_buff0~0_63 v_~b$w_buff0~0_62) (= v_~b$w_buff0_used~0_139 (ite .cse0 v_~b$w_buff0_used~0_140 (ite .cse7 v_~b$w_buff0_used~0_140 (ite .cse8 0 v_~b$w_buff0_used~0_140)))) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= (ite .cse0 v_~b$r_buff0_thd4~0_58 (ite (or .cse1 (and .cse2 .cse9) .cse6) v_~b$r_buff0_thd4~0_58 (ite (and .cse10 (not .cse1)) 0 v_~b$r_buff0_thd4~0_58))) v_~b$r_buff0_thd4~0_57) (= v_~b$w_buff1~0_54 v_~b$w_buff1~0_53))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_140, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~b~0=v_~b~0_99, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_56, ~b$w_buff1~0=v_~b$w_buff1~0_54, ~b$w_buff0~0=v_~b$w_buff0~0_63, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_58, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_16, ~b$flush_delayed~0=v_~b$flush_delayed~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_139, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_98, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_55, ~b$w_buff1~0=v_~b$w_buff1~0_53, ~b$w_buff0~0=v_~b$w_buff0~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_57} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3] and [394] L790-->L797: Formula: (let ((.cse5 (not (= (mod v_~b$r_buff0_thd2~0_28 256) 0))) (.cse3 (not (= (mod v_~b$w_buff0_used~0_143 256) 0))) (.cse4 (not (= (mod v_~b$r_buff1_thd2~0_26 256) 0)))) (let ((.cse1 (and (not (= (mod v_~b$w_buff1_used~0_131 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= 0 (mod v_~b$w_buff0_used~0_144 256)))))) (and (= v_~b~0_102 (ite .cse0 v_~b$w_buff0~0_66 (ite .cse1 v_~b$w_buff1~0_57 v_~b~0_103))) (= v_~b$w_buff1_used~0_130 (ite (or .cse2 .cse1) 0 v_~b$w_buff1_used~0_131)) (= (ite .cse2 0 v_~b$r_buff0_thd2~0_28) v_~b$r_buff0_thd2~0_27) (= (ite .cse0 0 v_~b$w_buff0_used~0_144) v_~b$w_buff0_used~0_143) (= v_~b$r_buff1_thd2~0_25 (ite (or (and (not (= (mod v_~b$r_buff0_thd2~0_27 256) 0)) .cse3) (and (not (= (mod v_~b$w_buff1_used~0_130 256) 0)) .cse4)) 0 v_~b$r_buff1_thd2~0_26))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_144, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_28, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_131, ~b~0=v_~b~0_103, ~b$w_buff1~0=v_~b$w_buff1~0_57, ~b$w_buff0~0=v_~b$w_buff0~0_66, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_26} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_143, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_27, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_130, ~b~0=v_~b~0_102, ~b$w_buff1~0=v_~b$w_buff1~0_57, ~b$w_buff0~0=v_~b$w_buff0~0_66, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_25} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0] [2022-12-13 11:52:32,799 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:52:32,800 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2281 [2022-12-13 11:52:32,800 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 89 transitions, 419 flow [2022-12-13 11:52:32,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 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-13 11:52:32,800 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:32,800 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:32,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:52:32,800 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:52:32,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:32,801 INFO L85 PathProgramCache]: Analyzing trace with hash 811553852, now seen corresponding path program 1 times [2022-12-13 11:52:32,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:32,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194761264] [2022-12-13 11:52:32,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:32,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:33,012 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-13 11:52:33,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:33,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194761264] [2022-12-13 11:52:33,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194761264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:33,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:33,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:52:33,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359761798] [2022-12-13 11:52:33,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:33,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:52:33,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:33,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:52:33,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:52:33,016 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2022-12-13 11:52:33,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 89 transitions, 419 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 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-13 11:52:33,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:33,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2022-12-13 11:52:33,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:35,225 INFO L130 PetriNetUnfolder]: 17093/26443 cut-off events. [2022-12-13 11:52:35,225 INFO L131 PetriNetUnfolder]: For 18856/18988 co-relation queries the response was YES. [2022-12-13 11:52:35,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89510 conditions, 26443 events. 17093/26443 cut-off events. For 18856/18988 co-relation queries the response was YES. Maximal size of possible extension queue 1023. Compared 186794 event pairs, 1215 based on Foata normal form. 1924/19266 useless extension candidates. Maximal degree in co-relation 89492. Up to 12844 conditions per place. [2022-12-13 11:52:35,357 INFO L137 encePairwiseOnDemand]: 34/48 looper letters, 113 selfloop transitions, 37 changer transitions 12/176 dead transitions. [2022-12-13 11:52:35,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 176 transitions, 1128 flow [2022-12-13 11:52:35,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:52:35,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:52:35,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 175 transitions. [2022-12-13 11:52:35,359 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7291666666666666 [2022-12-13 11:52:35,359 INFO L175 Difference]: Start difference. First operand has 66 places, 89 transitions, 419 flow. Second operand 5 states and 175 transitions. [2022-12-13 11:52:35,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 176 transitions, 1128 flow [2022-12-13 11:52:35,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 176 transitions, 1104 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-12-13 11:52:35,470 INFO L231 Difference]: Finished difference. Result has 70 places, 98 transitions, 587 flow [2022-12-13 11:52:35,470 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=587, PETRI_PLACES=70, PETRI_TRANSITIONS=98} [2022-12-13 11:52:35,471 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -26 predicate places. [2022-12-13 11:52:35,471 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:35,471 INFO L89 Accepts]: Start accepts. Operand has 70 places, 98 transitions, 587 flow [2022-12-13 11:52:35,472 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:35,472 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:35,472 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 98 transitions, 587 flow [2022-12-13 11:52:35,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 98 transitions, 587 flow [2022-12-13 11:52:35,968 INFO L130 PetriNetUnfolder]: 5717/10197 cut-off events. [2022-12-13 11:52:35,969 INFO L131 PetriNetUnfolder]: For 5273/10856 co-relation queries the response was YES. [2022-12-13 11:52:35,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37954 conditions, 10197 events. 5717/10197 cut-off events. For 5273/10856 co-relation queries the response was YES. Maximal size of possible extension queue 1215. Compared 87315 event pairs, 535 based on Foata normal form. 60/5069 useless extension candidates. Maximal degree in co-relation 37937. Up to 7660 conditions per place. [2022-12-13 11:52:36,053 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 98 transitions, 587 flow [2022-12-13 11:52:36,054 INFO L226 LiptonReduction]: Number of co-enabled transitions 2636 [2022-12-13 11:52:36,291 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:52:36,292 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 821 [2022-12-13 11:52:36,292 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 98 transitions, 593 flow [2022-12-13 11:52:36,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 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-13 11:52:36,292 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:36,292 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:36,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:52:36,293 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:52:36,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:36,293 INFO L85 PathProgramCache]: Analyzing trace with hash 478708035, now seen corresponding path program 1 times [2022-12-13 11:52:36,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:36,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265791636] [2022-12-13 11:52:36,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:36,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:36,994 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-13 11:52:36,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:36,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265791636] [2022-12-13 11:52:36,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265791636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:36,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:36,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:52:36,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840114678] [2022-12-13 11:52:36,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:36,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:52:36,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:36,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:52:36,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:52:36,996 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2022-12-13 11:52:36,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 98 transitions, 593 flow. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 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-13 11:52:36,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:36,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2022-12-13 11:52:36,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:39,612 INFO L130 PetriNetUnfolder]: 18667/30177 cut-off events. [2022-12-13 11:52:39,612 INFO L131 PetriNetUnfolder]: For 38100/43382 co-relation queries the response was YES. [2022-12-13 11:52:39,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123345 conditions, 30177 events. 18667/30177 cut-off events. For 38100/43382 co-relation queries the response was YES. Maximal size of possible extension queue 1542. Compared 239564 event pairs, 3042 based on Foata normal form. 2232/25968 useless extension candidates. Maximal degree in co-relation 123325. Up to 17255 conditions per place. [2022-12-13 11:52:39,861 INFO L137 encePairwiseOnDemand]: 35/47 looper letters, 170 selfloop transitions, 24 changer transitions 16/240 dead transitions. [2022-12-13 11:52:39,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 240 transitions, 1975 flow [2022-12-13 11:52:39,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:52:39,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:52:39,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2022-12-13 11:52:39,862 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6382978723404256 [2022-12-13 11:52:39,862 INFO L175 Difference]: Start difference. First operand has 70 places, 98 transitions, 593 flow. Second operand 7 states and 210 transitions. [2022-12-13 11:52:39,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 240 transitions, 1975 flow [2022-12-13 11:52:40,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 240 transitions, 1653 flow, removed 80 selfloop flow, removed 3 redundant places. [2022-12-13 11:52:40,444 INFO L231 Difference]: Finished difference. Result has 77 places, 111 transitions, 645 flow [2022-12-13 11:52:40,444 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=645, PETRI_PLACES=77, PETRI_TRANSITIONS=111} [2022-12-13 11:52:40,445 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -19 predicate places. [2022-12-13 11:52:40,445 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:40,445 INFO L89 Accepts]: Start accepts. Operand has 77 places, 111 transitions, 645 flow [2022-12-13 11:52:40,446 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:40,446 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:40,446 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 111 transitions, 645 flow [2022-12-13 11:52:40,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 111 transitions, 645 flow [2022-12-13 11:52:41,211 INFO L130 PetriNetUnfolder]: 7222/13093 cut-off events. [2022-12-13 11:52:41,211 INFO L131 PetriNetUnfolder]: For 12987/14064 co-relation queries the response was YES. [2022-12-13 11:52:41,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42986 conditions, 13093 events. 7222/13093 cut-off events. For 12987/14064 co-relation queries the response was YES. Maximal size of possible extension queue 1746. Compared 119440 event pairs, 632 based on Foata normal form. 171/6553 useless extension candidates. Maximal degree in co-relation 42965. Up to 8317 conditions per place. [2022-12-13 11:52:41,291 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 111 transitions, 645 flow [2022-12-13 11:52:41,291 INFO L226 LiptonReduction]: Number of co-enabled transitions 3260 [2022-12-13 11:52:41,764 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] L833-->L849: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_56 256) 0)) (.cse9 (= (mod v_~b$r_buff0_thd4~0_58 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~b$w_buff0_used~0_140 256) 0)) (.cse5 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse9)) (.cse6 (and .cse4 .cse9))) (let ((.cse7 (or .cse11 .cse5 .cse6)) (.cse8 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse1 (= (mod v_~b$w_buff0_used~0_139 256) 0))) (and (= v_~b$r_buff1_thd4~0_55 (ite .cse0 v_~b$r_buff1_thd4~0_56 (ite (let ((.cse3 (= (mod v_~b$r_buff0_thd4~0_57 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse4 .cse3))) v_~b$r_buff1_thd4~0_56 0))) (= v_~b$flush_delayed~0_23 0) (= v_~b~0_98 (ite .cse0 v_~b$mem_tmp~0_16 v_~__unbuffered_p3_EBX~0_14)) (= v_~b$mem_tmp~0_16 v_~b~0_99) (= v_~b$w_buff1_used~0_126 (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse5 .cse6) v_~b$w_buff1_used~0_127 0))) (= (ite .cse7 v_~b~0_99 (ite .cse8 v_~b$w_buff0~0_63 v_~b$w_buff1~0_54)) v_~__unbuffered_p3_EBX~0_14) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~b$w_buff0~0_63 v_~b$w_buff0~0_62) (= v_~b$w_buff0_used~0_139 (ite .cse0 v_~b$w_buff0_used~0_140 (ite .cse7 v_~b$w_buff0_used~0_140 (ite .cse8 0 v_~b$w_buff0_used~0_140)))) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= (ite .cse0 v_~b$r_buff0_thd4~0_58 (ite (or .cse1 (and .cse2 .cse9) .cse6) v_~b$r_buff0_thd4~0_58 (ite (and .cse10 (not .cse1)) 0 v_~b$r_buff0_thd4~0_58))) v_~b$r_buff0_thd4~0_57) (= v_~b$w_buff1~0_54 v_~b$w_buff1~0_53))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_140, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~b~0=v_~b~0_99, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_56, ~b$w_buff1~0=v_~b$w_buff1~0_54, ~b$w_buff0~0=v_~b$w_buff0~0_63, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_58, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_16, ~b$flush_delayed~0=v_~b$flush_delayed~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_139, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_98, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_55, ~b$w_buff1~0=v_~b$w_buff1~0_53, ~b$w_buff0~0=v_~b$w_buff0~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_57} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3] and [401] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~b$w_buff0_used~0_95 256) 0))) (.cse3 (not (= (mod v_~b$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd3~0_20 256) 0)))) (let ((.cse1 (and .cse5 (not (= (mod v_~b$w_buff0_used~0_96 256) 0)))) (.cse2 (and (not (= (mod v_~b$w_buff1_used~0_83 256) 0)) .cse3)) (.cse0 (and .cse5 .cse4))) (and (= (ite .cse0 0 v_~b$r_buff0_thd3~0_20) v_~b$r_buff0_thd3~0_19) (= (ite .cse1 v_~b$w_buff0~0_38 (ite .cse2 v_~b$w_buff1~0_31 v_~b~0_59)) v_~b~0_58) (= v_~b$w_buff0_used~0_95 (ite .cse1 0 v_~b$w_buff0_used~0_96)) (= (ite (or (and (not (= (mod v_~b$w_buff1_used~0_82 256) 0)) .cse3) (and .cse4 (not (= (mod v_~b$r_buff0_thd3~0_19 256) 0)))) 0 v_~b$r_buff1_thd3~0_18) v_~b$r_buff1_thd3~0_17) (= (ite (or .cse2 .cse0) 0 v_~b$w_buff1_used~0_83) v_~b$w_buff1_used~0_82)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_96, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_20, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_83, ~b~0=v_~b~0_59, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_38, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_18} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_95, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_19, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_82, ~b~0=v_~b~0_58, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_38, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_17} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd3~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd3~0] [2022-12-13 11:52:42,071 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:52:42,071 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1626 [2022-12-13 11:52:42,072 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 110 transitions, 649 flow [2022-12-13 11:52:42,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 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-13 11:52:42,072 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:42,072 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:42,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:52:42,072 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:52:42,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:42,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1264816267, now seen corresponding path program 1 times [2022-12-13 11:52:42,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:42,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456264223] [2022-12-13 11:52:42,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:42,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:42,574 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-13 11:52:42,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:42,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456264223] [2022-12-13 11:52:42,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456264223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:42,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:42,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:52:42,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204485240] [2022-12-13 11:52:42,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:42,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:52:42,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:42,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:52:42,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:52:42,576 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2022-12-13 11:52:42,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 110 transitions, 649 flow. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 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-13 11:52:42,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:42,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2022-12-13 11:52:42,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:45,817 INFO L130 PetriNetUnfolder]: 26196/42600 cut-off events. [2022-12-13 11:52:45,817 INFO L131 PetriNetUnfolder]: For 78351/83422 co-relation queries the response was YES. [2022-12-13 11:52:45,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165142 conditions, 42600 events. 26196/42600 cut-off events. For 78351/83422 co-relation queries the response was YES. Maximal size of possible extension queue 2439. Compared 357103 event pairs, 3472 based on Foata normal form. 2525/35749 useless extension candidates. Maximal degree in co-relation 165118. Up to 23595 conditions per place. [2022-12-13 11:52:46,069 INFO L137 encePairwiseOnDemand]: 37/50 looper letters, 184 selfloop transitions, 16 changer transitions 6/236 dead transitions. [2022-12-13 11:52:46,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 236 transitions, 1759 flow [2022-12-13 11:52:46,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:52:46,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:52:46,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2022-12-13 11:52:46,071 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-13 11:52:46,071 INFO L175 Difference]: Start difference. First operand has 76 places, 110 transitions, 649 flow. Second operand 6 states and 195 transitions. [2022-12-13 11:52:46,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 236 transitions, 1759 flow [2022-12-13 11:52:47,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 236 transitions, 1734 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-13 11:52:47,702 INFO L231 Difference]: Finished difference. Result has 82 places, 124 transitions, 826 flow [2022-12-13 11:52:47,702 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=826, PETRI_PLACES=82, PETRI_TRANSITIONS=124} [2022-12-13 11:52:47,703 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -14 predicate places. [2022-12-13 11:52:47,703 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:47,703 INFO L89 Accepts]: Start accepts. Operand has 82 places, 124 transitions, 826 flow [2022-12-13 11:52:47,704 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:47,704 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:47,704 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 124 transitions, 826 flow [2022-12-13 11:52:47,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 124 transitions, 826 flow [2022-12-13 11:52:48,950 INFO L130 PetriNetUnfolder]: 11622/21201 cut-off events. [2022-12-13 11:52:48,950 INFO L131 PetriNetUnfolder]: For 20324/25456 co-relation queries the response was YES. [2022-12-13 11:52:49,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70146 conditions, 21201 events. 11622/21201 cut-off events. For 20324/25456 co-relation queries the response was YES. Maximal size of possible extension queue 2853. Compared 209551 event pairs, 1054 based on Foata normal form. 199/10239 useless extension candidates. Maximal degree in co-relation 70122. Up to 14041 conditions per place. [2022-12-13 11:52:49,129 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 124 transitions, 826 flow [2022-12-13 11:52:49,129 INFO L226 LiptonReduction]: Number of co-enabled transitions 3546 [2022-12-13 11:52:49,355 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:52:49,356 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1653 [2022-12-13 11:52:49,356 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 124 transitions, 826 flow [2022-12-13 11:52:49,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 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-13 11:52:49,356 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:49,356 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:49,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:52:49,357 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:52:49,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:49,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1401788263, now seen corresponding path program 1 times [2022-12-13 11:52:49,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:49,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380761585] [2022-12-13 11:52:49,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:49,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:49,485 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-13 11:52:49,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:49,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380761585] [2022-12-13 11:52:49,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380761585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:49,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:49,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:52:49,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782265972] [2022-12-13 11:52:49,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:49,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:52:49,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:49,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:52:49,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:52:49,487 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2022-12-13 11:52:49,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 124 transitions, 826 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 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-13 11:52:49,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:49,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2022-12-13 11:52:49,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:55,732 INFO L130 PetriNetUnfolder]: 51372/80564 cut-off events. [2022-12-13 11:52:55,732 INFO L131 PetriNetUnfolder]: For 144024/152659 co-relation queries the response was YES. [2022-12-13 11:52:56,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312102 conditions, 80564 events. 51372/80564 cut-off events. For 144024/152659 co-relation queries the response was YES. Maximal size of possible extension queue 4226. Compared 687707 event pairs, 7830 based on Foata normal form. 5848/69426 useless extension candidates. Maximal degree in co-relation 312075. Up to 34081 conditions per place. [2022-12-13 11:52:56,191 INFO L137 encePairwiseOnDemand]: 42/50 looper letters, 195 selfloop transitions, 10 changer transitions 56/284 dead transitions. [2022-12-13 11:52:56,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 284 transitions, 2413 flow [2022-12-13 11:52:56,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:52:56,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:52:56,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2022-12-13 11:52:56,194 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2022-12-13 11:52:56,194 INFO L175 Difference]: Start difference. First operand has 82 places, 124 transitions, 826 flow. Second operand 6 states and 184 transitions. [2022-12-13 11:52:56,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 284 transitions, 2413 flow [2022-12-13 11:53:01,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 284 transitions, 2396 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:53:01,356 INFO L231 Difference]: Finished difference. Result has 88 places, 125 transitions, 833 flow [2022-12-13 11:53:01,357 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=833, PETRI_PLACES=88, PETRI_TRANSITIONS=125} [2022-12-13 11:53:01,357 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -8 predicate places. [2022-12-13 11:53:01,357 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:53:01,357 INFO L89 Accepts]: Start accepts. Operand has 88 places, 125 transitions, 833 flow [2022-12-13 11:53:01,358 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:53:01,358 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:53:01,358 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 125 transitions, 833 flow [2022-12-13 11:53:01,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 125 transitions, 833 flow [2022-12-13 11:53:03,374 INFO L130 PetriNetUnfolder]: 18691/34232 cut-off events. [2022-12-13 11:53:03,375 INFO L131 PetriNetUnfolder]: For 34988/45822 co-relation queries the response was YES. [2022-12-13 11:53:03,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114466 conditions, 34232 events. 18691/34232 cut-off events. For 34988/45822 co-relation queries the response was YES. Maximal size of possible extension queue 4758. Compared 362597 event pairs, 1792 based on Foata normal form. 285/16280 useless extension candidates. Maximal degree in co-relation 114439. Up to 23113 conditions per place. [2022-12-13 11:53:03,666 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 125 transitions, 833 flow [2022-12-13 11:53:03,666 INFO L226 LiptonReduction]: Number of co-enabled transitions 3564 [2022-12-13 11:53:03,692 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [443] $Ultimate##0-->L787: Formula: (and (= v_~x~0_4 1) (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~x~0] and [408] L830-->L833: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~a~0=v_~a~0_2} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0] [2022-12-13 11:53:03,706 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [443] $Ultimate##0-->L787: Formula: (and (= v_~x~0_4 1) (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~x~0] and [400] L807-->L810: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_1) InVars {~z~0=v_~z~0_1} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] [2022-12-13 11:53:04,525 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:53:04,526 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3169 [2022-12-13 11:53:04,526 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 124 transitions, 835 flow [2022-12-13 11:53:04,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 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-13 11:53:04,526 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:53:04,526 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:53:04,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:53:04,527 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:53:04,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:53:04,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1381068909, now seen corresponding path program 1 times [2022-12-13 11:53:04,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:53:04,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764497197] [2022-12-13 11:53:04,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:53:04,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:53:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:53:04,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-13 11:53:04,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:53:04,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764497197] [2022-12-13 11:53:04,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764497197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:53:04,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:53:04,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:53:04,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206679777] [2022-12-13 11:53:04,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:53:04,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:53:04,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:53:04,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:53:04,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:53:04,740 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2022-12-13 11:53:04,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 124 transitions, 835 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 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-13 11:53:04,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:53:04,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2022-12-13 11:53:04,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:53:08,563 INFO L130 PetriNetUnfolder]: 34456/52723 cut-off events. [2022-12-13 11:53:08,563 INFO L131 PetriNetUnfolder]: For 88016/88427 co-relation queries the response was YES. [2022-12-13 11:53:08,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204220 conditions, 52723 events. 34456/52723 cut-off events. For 88016/88427 co-relation queries the response was YES. Maximal size of possible extension queue 2415. Compared 407360 event pairs, 964 based on Foata normal form. 4145/34243 useless extension candidates. Maximal degree in co-relation 204190. Up to 18927 conditions per place. [2022-12-13 11:53:08,807 INFO L137 encePairwiseOnDemand]: 37/53 looper letters, 108 selfloop transitions, 49 changer transitions 56/225 dead transitions. [2022-12-13 11:53:08,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 225 transitions, 1950 flow [2022-12-13 11:53:08,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:53:08,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:53:08,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2022-12-13 11:53:08,808 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.610062893081761 [2022-12-13 11:53:08,808 INFO L175 Difference]: Start difference. First operand has 87 places, 124 transitions, 835 flow. Second operand 6 states and 194 transitions. [2022-12-13 11:53:08,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 225 transitions, 1950 flow [2022-12-13 11:53:16,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 225 transitions, 1933 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 11:53:16,751 INFO L231 Difference]: Finished difference. Result has 91 places, 104 transitions, 768 flow [2022-12-13 11:53:16,751 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=768, PETRI_PLACES=91, PETRI_TRANSITIONS=104} [2022-12-13 11:53:16,752 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -5 predicate places. [2022-12-13 11:53:16,752 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:53:16,752 INFO L89 Accepts]: Start accepts. Operand has 91 places, 104 transitions, 768 flow [2022-12-13 11:53:16,753 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:53:16,753 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:53:16,753 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 104 transitions, 768 flow [2022-12-13 11:53:16,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 104 transitions, 768 flow [2022-12-13 11:53:17,085 INFO L130 PetriNetUnfolder]: 4127/7265 cut-off events. [2022-12-13 11:53:17,086 INFO L131 PetriNetUnfolder]: For 6411/10170 co-relation queries the response was YES. [2022-12-13 11:53:17,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28452 conditions, 7265 events. 4127/7265 cut-off events. For 6411/10170 co-relation queries the response was YES. Maximal size of possible extension queue 863. Compared 56902 event pairs, 14 based on Foata normal form. 24/2648 useless extension candidates. Maximal degree in co-relation 28424. Up to 4240 conditions per place. [2022-12-13 11:53:17,153 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 104 transitions, 768 flow [2022-12-13 11:53:17,153 INFO L226 LiptonReduction]: Number of co-enabled transitions 2334 [2022-12-13 11:53:17,896 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:53:17,897 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1145 [2022-12-13 11:53:17,897 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 102 transitions, 778 flow [2022-12-13 11:53:17,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 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-13 11:53:17,897 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:53:17,897 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:53:17,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:53:17,897 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:53:17,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:53:17,897 INFO L85 PathProgramCache]: Analyzing trace with hash -417973765, now seen corresponding path program 1 times [2022-12-13 11:53:17,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:53:17,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538758989] [2022-12-13 11:53:17,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:53:17,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:53:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:53:18,014 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-13 11:53:18,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:53:18,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538758989] [2022-12-13 11:53:18,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538758989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:53:18,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:53:18,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:53:18,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192414801] [2022-12-13 11:53:18,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:53:18,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:53:18,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:53:18,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:53:18,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:53:18,017 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2022-12-13 11:53:18,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 102 transitions, 778 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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-13 11:53:18,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:53:18,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2022-12-13 11:53:18,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:53:20,087 INFO L130 PetriNetUnfolder]: 17157/26793 cut-off events. [2022-12-13 11:53:20,087 INFO L131 PetriNetUnfolder]: For 72945/75546 co-relation queries the response was YES. [2022-12-13 11:53:20,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117896 conditions, 26793 events. 17157/26793 cut-off events. For 72945/75546 co-relation queries the response was YES. Maximal size of possible extension queue 1620. Compared 198953 event pairs, 2962 based on Foata normal form. 1114/21212 useless extension candidates. Maximal degree in co-relation 117865. Up to 9703 conditions per place. [2022-12-13 11:53:20,231 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 159 selfloop transitions, 3 changer transitions 13/201 dead transitions. [2022-12-13 11:53:20,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 201 transitions, 1930 flow [2022-12-13 11:53:20,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:53:20,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:53:20,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-12-13 11:53:20,233 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 11:53:20,233 INFO L175 Difference]: Start difference. First operand has 84 places, 102 transitions, 778 flow. Second operand 4 states and 112 transitions. [2022-12-13 11:53:20,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 201 transitions, 1930 flow [2022-12-13 11:53:23,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 201 transitions, 1646 flow, removed 66 selfloop flow, removed 7 redundant places. [2022-12-13 11:53:23,743 INFO L231 Difference]: Finished difference. Result has 82 places, 104 transitions, 648 flow [2022-12-13 11:53:23,743 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=648, PETRI_PLACES=82, PETRI_TRANSITIONS=104} [2022-12-13 11:53:23,743 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -14 predicate places. [2022-12-13 11:53:23,743 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:53:23,743 INFO L89 Accepts]: Start accepts. Operand has 82 places, 104 transitions, 648 flow [2022-12-13 11:53:23,744 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:53:23,744 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:53:23,744 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 104 transitions, 648 flow [2022-12-13 11:53:23,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 104 transitions, 648 flow [2022-12-13 11:53:24,266 INFO L130 PetriNetUnfolder]: 6998/11666 cut-off events. [2022-12-13 11:53:24,267 INFO L131 PetriNetUnfolder]: For 9828/10956 co-relation queries the response was YES. [2022-12-13 11:53:24,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34715 conditions, 11666 events. 6998/11666 cut-off events. For 9828/10956 co-relation queries the response was YES. Maximal size of possible extension queue 1728. Compared 95316 event pairs, 25 based on Foata normal form. 113/3761 useless extension candidates. Maximal degree in co-relation 34689. Up to 5239 conditions per place. [2022-12-13 11:53:24,384 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 104 transitions, 648 flow [2022-12-13 11:53:24,384 INFO L226 LiptonReduction]: Number of co-enabled transitions 2374 [2022-12-13 11:53:24,389 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] $Ultimate##0-->L830: Formula: (and (= v_~z~0_11 1) (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= v_~a~0_12 1) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5)) InVars {P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{~a~0=v_~a~0_12, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~z~0=v_~z~0_11, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[~a~0, P3Thread1of1ForFork2_~arg.offset, ~z~0, P3Thread1of1ForFork2_~arg.base] and [400] L807-->L810: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_1) InVars {~z~0=v_~z~0_1} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] [2022-12-13 11:53:24,412 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:53:24,413 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 670 [2022-12-13 11:53:24,413 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 104 transitions, 651 flow [2022-12-13 11:53:24,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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-13 11:53:24,413 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:53:24,414 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:53:24,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 11:53:24,414 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:53:24,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:53:24,414 INFO L85 PathProgramCache]: Analyzing trace with hash -494335365, now seen corresponding path program 2 times [2022-12-13 11:53:24,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:53:24,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221313786] [2022-12-13 11:53:24,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:53:24,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:53:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:53:24,894 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-13 11:53:24,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:53:24,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221313786] [2022-12-13 11:53:24,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221313786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:53:24,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:53:24,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:53:24,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787646006] [2022-12-13 11:53:24,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:53:24,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:53:24,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:53:24,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:53:24,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:53:24,896 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2022-12-13 11:53:24,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 104 transitions, 651 flow. Second operand has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 0 states have call successors, (0), 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-13 11:53:24,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:53:24,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2022-12-13 11:53:24,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:53:27,786 INFO L130 PetriNetUnfolder]: 25264/38599 cut-off events. [2022-12-13 11:53:27,786 INFO L131 PetriNetUnfolder]: For 71168/73712 co-relation queries the response was YES. [2022-12-13 11:53:27,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145351 conditions, 38599 events. 25264/38599 cut-off events. For 71168/73712 co-relation queries the response was YES. Maximal size of possible extension queue 2743. Compared 298582 event pairs, 2367 based on Foata normal form. 1246/29180 useless extension candidates. Maximal degree in co-relation 145322. Up to 15447 conditions per place. [2022-12-13 11:53:27,971 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 134 selfloop transitions, 26 changer transitions 54/240 dead transitions. [2022-12-13 11:53:27,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 240 transitions, 1854 flow [2022-12-13 11:53:27,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:53:27,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:53:27,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 192 transitions. [2022-12-13 11:53:27,972 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6378737541528239 [2022-12-13 11:53:27,972 INFO L175 Difference]: Start difference. First operand has 82 places, 104 transitions, 651 flow. Second operand 7 states and 192 transitions. [2022-12-13 11:53:27,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 240 transitions, 1854 flow [2022-12-13 11:53:39,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 240 transitions, 1849 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:53:39,190 INFO L231 Difference]: Finished difference. Result has 91 places, 112 transitions, 831 flow [2022-12-13 11:53:39,190 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=831, PETRI_PLACES=91, PETRI_TRANSITIONS=112} [2022-12-13 11:53:39,190 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -5 predicate places. [2022-12-13 11:53:39,190 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:53:39,191 INFO L89 Accepts]: Start accepts. Operand has 91 places, 112 transitions, 831 flow [2022-12-13 11:53:39,191 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:53:39,191 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:53:39,192 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 112 transitions, 831 flow [2022-12-13 11:53:39,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 112 transitions, 831 flow [2022-12-13 11:53:39,638 INFO L130 PetriNetUnfolder]: 6093/9739 cut-off events. [2022-12-13 11:53:39,638 INFO L131 PetriNetUnfolder]: For 17843/18724 co-relation queries the response was YES. [2022-12-13 11:53:39,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30442 conditions, 9739 events. 6093/9739 cut-off events. For 17843/18724 co-relation queries the response was YES. Maximal size of possible extension queue 1305. Compared 72755 event pairs, 10 based on Foata normal form. 101/3292 useless extension candidates. Maximal degree in co-relation 30411. Up to 4672 conditions per place. [2022-12-13 11:53:39,745 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 112 transitions, 831 flow [2022-12-13 11:53:39,745 INFO L226 LiptonReduction]: Number of co-enabled transitions 2680 [2022-12-13 11:53:39,786 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] L833-->L849: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_56 256) 0)) (.cse9 (= (mod v_~b$r_buff0_thd4~0_58 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~b$w_buff0_used~0_140 256) 0)) (.cse5 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse9)) (.cse6 (and .cse4 .cse9))) (let ((.cse7 (or .cse11 .cse5 .cse6)) (.cse8 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse1 (= (mod v_~b$w_buff0_used~0_139 256) 0))) (and (= v_~b$r_buff1_thd4~0_55 (ite .cse0 v_~b$r_buff1_thd4~0_56 (ite (let ((.cse3 (= (mod v_~b$r_buff0_thd4~0_57 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse4 .cse3))) v_~b$r_buff1_thd4~0_56 0))) (= v_~b$flush_delayed~0_23 0) (= v_~b~0_98 (ite .cse0 v_~b$mem_tmp~0_16 v_~__unbuffered_p3_EBX~0_14)) (= v_~b$mem_tmp~0_16 v_~b~0_99) (= v_~b$w_buff1_used~0_126 (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse5 .cse6) v_~b$w_buff1_used~0_127 0))) (= (ite .cse7 v_~b~0_99 (ite .cse8 v_~b$w_buff0~0_63 v_~b$w_buff1~0_54)) v_~__unbuffered_p3_EBX~0_14) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~b$w_buff0~0_63 v_~b$w_buff0~0_62) (= v_~b$w_buff0_used~0_139 (ite .cse0 v_~b$w_buff0_used~0_140 (ite .cse7 v_~b$w_buff0_used~0_140 (ite .cse8 0 v_~b$w_buff0_used~0_140)))) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= (ite .cse0 v_~b$r_buff0_thd4~0_58 (ite (or .cse1 (and .cse2 .cse9) .cse6) v_~b$r_buff0_thd4~0_58 (ite (and .cse10 (not .cse1)) 0 v_~b$r_buff0_thd4~0_58))) v_~b$r_buff0_thd4~0_57) (= v_~b$w_buff1~0_54 v_~b$w_buff1~0_53))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_140, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~b~0=v_~b~0_99, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_56, ~b$w_buff1~0=v_~b$w_buff1~0_54, ~b$w_buff0~0=v_~b$w_buff0~0_63, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_58, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_16, ~b$flush_delayed~0=v_~b$flush_delayed~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_139, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_98, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_55, ~b$w_buff1~0=v_~b$w_buff1~0_53, ~b$w_buff0~0=v_~b$w_buff0~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_57} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3] and [394] L790-->L797: Formula: (let ((.cse5 (not (= (mod v_~b$r_buff0_thd2~0_28 256) 0))) (.cse3 (not (= (mod v_~b$w_buff0_used~0_143 256) 0))) (.cse4 (not (= (mod v_~b$r_buff1_thd2~0_26 256) 0)))) (let ((.cse1 (and (not (= (mod v_~b$w_buff1_used~0_131 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= 0 (mod v_~b$w_buff0_used~0_144 256)))))) (and (= v_~b~0_102 (ite .cse0 v_~b$w_buff0~0_66 (ite .cse1 v_~b$w_buff1~0_57 v_~b~0_103))) (= v_~b$w_buff1_used~0_130 (ite (or .cse2 .cse1) 0 v_~b$w_buff1_used~0_131)) (= (ite .cse2 0 v_~b$r_buff0_thd2~0_28) v_~b$r_buff0_thd2~0_27) (= (ite .cse0 0 v_~b$w_buff0_used~0_144) v_~b$w_buff0_used~0_143) (= v_~b$r_buff1_thd2~0_25 (ite (or (and (not (= (mod v_~b$r_buff0_thd2~0_27 256) 0)) .cse3) (and (not (= (mod v_~b$w_buff1_used~0_130 256) 0)) .cse4)) 0 v_~b$r_buff1_thd2~0_26))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_144, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_28, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_131, ~b~0=v_~b~0_103, ~b$w_buff1~0=v_~b$w_buff1~0_57, ~b$w_buff0~0=v_~b$w_buff0~0_66, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_26} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_143, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_27, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_130, ~b~0=v_~b~0_102, ~b$w_buff1~0=v_~b$w_buff1~0_57, ~b$w_buff0~0=v_~b$w_buff0~0_66, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_25} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0] [2022-12-13 11:53:40,236 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:53:40,236 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1046 [2022-12-13 11:53:40,236 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 110 transitions, 829 flow [2022-12-13 11:53:40,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 0 states have call successors, (0), 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-13 11:53:40,237 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:53:40,237 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:53:40,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 11:53:40,237 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:53:40,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:53:40,237 INFO L85 PathProgramCache]: Analyzing trace with hash -269119236, now seen corresponding path program 1 times [2022-12-13 11:53:40,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:53:40,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159676906] [2022-12-13 11:53:40,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:53:40,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:53:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:53:40,407 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-13 11:53:40,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:53:40,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159676906] [2022-12-13 11:53:40,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159676906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:53:40,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:53:40,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:53:40,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568426131] [2022-12-13 11:53:40,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:53:40,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:53:40,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:53:40,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:53:40,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:53:40,410 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2022-12-13 11:53:40,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 110 transitions, 829 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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-13 11:53:40,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:53:40,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2022-12-13 11:53:40,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:53:42,421 INFO L130 PetriNetUnfolder]: 18190/27433 cut-off events. [2022-12-13 11:53:42,422 INFO L131 PetriNetUnfolder]: For 77138/78678 co-relation queries the response was YES. [2022-12-13 11:53:42,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108411 conditions, 27433 events. 18190/27433 cut-off events. For 77138/78678 co-relation queries the response was YES. Maximal size of possible extension queue 1664. Compared 196708 event pairs, 1425 based on Foata normal form. 1217/21283 useless extension candidates. Maximal degree in co-relation 108377. Up to 14030 conditions per place. [2022-12-13 11:53:42,536 INFO L137 encePairwiseOnDemand]: 35/42 looper letters, 70 selfloop transitions, 3 changer transitions 125/219 dead transitions. [2022-12-13 11:53:42,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 219 transitions, 2005 flow [2022-12-13 11:53:42,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:53:42,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:53:42,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2022-12-13 11:53:42,537 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-13 11:53:42,537 INFO L175 Difference]: Start difference. First operand has 87 places, 110 transitions, 829 flow. Second operand 6 states and 140 transitions. [2022-12-13 11:53:42,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 219 transitions, 2005 flow [2022-12-13 11:53:46,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 219 transitions, 1956 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-12-13 11:53:46,997 INFO L231 Difference]: Finished difference. Result has 91 places, 83 transitions, 520 flow [2022-12-13 11:53:46,997 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=520, PETRI_PLACES=91, PETRI_TRANSITIONS=83} [2022-12-13 11:53:46,998 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -5 predicate places. [2022-12-13 11:53:46,998 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:53:46,998 INFO L89 Accepts]: Start accepts. Operand has 91 places, 83 transitions, 520 flow [2022-12-13 11:53:46,998 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:53:46,998 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:53:46,999 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 83 transitions, 520 flow [2022-12-13 11:53:46,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 83 transitions, 520 flow [2022-12-13 11:53:47,117 INFO L130 PetriNetUnfolder]: 1691/2838 cut-off events. [2022-12-13 11:53:47,118 INFO L131 PetriNetUnfolder]: For 4206/4607 co-relation queries the response was YES. [2022-12-13 11:53:47,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8526 conditions, 2838 events. 1691/2838 cut-off events. For 4206/4607 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 18327 event pairs, 1 based on Foata normal form. 14/904 useless extension candidates. Maximal degree in co-relation 8494. Up to 1378 conditions per place. [2022-12-13 11:53:47,138 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 83 transitions, 520 flow [2022-12-13 11:53:47,138 INFO L226 LiptonReduction]: Number of co-enabled transitions 1304 [2022-12-13 11:53:48,001 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:53:48,002 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1004 [2022-12-13 11:53:48,002 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 82 transitions, 534 flow [2022-12-13 11:53:48,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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-13 11:53:48,002 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:53:48,003 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:53:48,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 11:53:48,003 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:53:48,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:53:48,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1060969756, now seen corresponding path program 1 times [2022-12-13 11:53:48,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:53:48,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884368093] [2022-12-13 11:53:48,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:53:48,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:53:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:53:48,082 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:53:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:53:48,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:53:48,157 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:53:48,158 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 11:53:48,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 11:53:48,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 11:53:48,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 11:53:48,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 11:53:48,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 11:53:48,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 11:53:48,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 11:53:48,163 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:53:48,167 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:53:48,167 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:53:48,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:53:48 BasicIcfg [2022-12-13 11:53:48,244 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:53:48,244 INFO L158 Benchmark]: Toolchain (without parser) took 105559.56ms. Allocated memory was 190.8MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 165.0MB in the beginning and 5.4GB in the end (delta: -5.2GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-13 11:53:48,244 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory is still 167.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:53:48,245 INFO L158 Benchmark]: CACSL2BoogieTranslator took 509.95ms. Allocated memory is still 190.8MB. Free memory was 165.0MB in the beginning and 136.6MB in the end (delta: 28.4MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-13 11:53:48,247 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.08ms. Allocated memory is still 190.8MB. Free memory was 136.6MB in the beginning and 134.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:53:48,247 INFO L158 Benchmark]: Boogie Preprocessor took 44.10ms. Allocated memory is still 190.8MB. Free memory was 134.0MB in the beginning and 131.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:53:48,247 INFO L158 Benchmark]: RCFGBuilder took 631.87ms. Allocated memory is still 190.8MB. Free memory was 131.9MB in the beginning and 93.7MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-12-13 11:53:48,248 INFO L158 Benchmark]: TraceAbstraction took 104313.95ms. Allocated memory was 190.8MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 92.6MB in the beginning and 5.4GB in the end (delta: -5.3GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-13 11:53:48,249 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.09ms. Allocated memory is still 190.8MB. Free memory is still 167.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 509.95ms. Allocated memory is still 190.8MB. Free memory was 165.0MB in the beginning and 136.6MB in the end (delta: 28.4MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.08ms. Allocated memory is still 190.8MB. Free memory was 136.6MB in the beginning and 134.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.10ms. Allocated memory is still 190.8MB. Free memory was 134.0MB in the beginning and 131.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 631.87ms. Allocated memory is still 190.8MB. Free memory was 131.9MB in the beginning and 93.7MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 104313.95ms. Allocated memory was 190.8MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 92.6MB in the beginning and 5.4GB in the end (delta: -5.3GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 141 PlacesBefore, 96 PlacesAfterwards, 130 TransitionsBefore, 83 TransitionsAfterwards, 3270 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 45 TrivialYvCompositions, 53 ConcurrentYvCompositions, 3 ChoiceCompositions, 103 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5658, independent: 5442, independent conditional: 5442, independent unconditional: 0, dependent: 216, dependent conditional: 216, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5658, independent: 5442, independent conditional: 0, independent unconditional: 5442, dependent: 216, dependent conditional: 0, dependent unconditional: 216, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5658, independent: 5442, independent conditional: 0, independent unconditional: 5442, dependent: 216, dependent conditional: 0, dependent unconditional: 216, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5658, independent: 5442, independent conditional: 0, independent unconditional: 5442, dependent: 216, dependent conditional: 0, dependent unconditional: 216, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2869, independent: 2796, independent conditional: 0, independent unconditional: 2796, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2869, independent: 2754, independent conditional: 0, independent unconditional: 2754, dependent: 115, dependent conditional: 0, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 115, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 377, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 338, dependent conditional: 0, dependent unconditional: 338, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5658, independent: 2646, independent conditional: 0, independent unconditional: 2646, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 2869, unknown conditional: 0, unknown unconditional: 2869] , Statistics on independence cache: Total cache size (in pairs): 6430, Positive cache size: 6357, Positive conditional cache size: 0, Positive unconditional cache size: 6357, Negative cache size: 73, Negative conditional cache size: 0, Negative unconditional cache size: 73, 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.1s, 56 PlacesBefore, 56 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 1210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 425, independent: 377, independent conditional: 377, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 425, independent: 377, independent conditional: 24, independent unconditional: 353, dependent: 48, dependent conditional: 18, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 425, independent: 377, independent conditional: 24, independent unconditional: 353, dependent: 48, dependent conditional: 18, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 425, independent: 377, independent conditional: 24, independent unconditional: 353, dependent: 48, dependent conditional: 18, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 393, independent: 357, independent conditional: 23, independent unconditional: 334, dependent: 36, dependent conditional: 10, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 393, independent: 276, independent conditional: 0, independent unconditional: 276, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 117, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 36, dependent conditional: 10, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 139, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 82, dependent conditional: 44, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 425, independent: 20, independent conditional: 1, independent unconditional: 19, dependent: 12, dependent conditional: 8, dependent unconditional: 4, unknown: 393, unknown conditional: 33, unknown unconditional: 360] , Statistics on independence cache: Total cache size (in pairs): 393, Positive cache size: 357, Positive conditional cache size: 23, Positive unconditional cache size: 334, Negative cache size: 36, Negative conditional cache size: 10, Negative unconditional cache size: 26, 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, 56 PlacesBefore, 56 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 1238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 424, independent: 385, independent conditional: 385, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 424, independent: 385, independent conditional: 9, independent unconditional: 376, dependent: 39, dependent conditional: 6, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 424, independent: 385, independent conditional: 0, independent unconditional: 385, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 424, independent: 385, independent conditional: 0, independent unconditional: 385, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 56, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 56, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 62, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 424, independent: 339, independent conditional: 0, independent unconditional: 339, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 56, unknown conditional: 0, unknown unconditional: 56] , Statistics on independence cache: Total cache size (in pairs): 449, Positive cache size: 403, Positive conditional cache size: 23, Positive unconditional cache size: 380, Negative cache size: 46, Negative conditional cache size: 10, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 1178 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 407, independent: 367, independent conditional: 367, 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: 407, independent: 367, independent conditional: 9, independent unconditional: 358, dependent: 40, dependent conditional: 6, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 407, independent: 367, independent conditional: 0, independent unconditional: 367, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 407, independent: 367, independent conditional: 0, independent unconditional: 367, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 407, independent: 367, independent conditional: 0, independent unconditional: 367, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 450, Positive cache size: 403, Positive conditional cache size: 23, Positive unconditional cache size: 380, Negative cache size: 47, Negative conditional cache size: 10, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 1450 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 246, independent: 208, independent conditional: 208, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 246, independent: 208, independent conditional: 20, independent unconditional: 188, dependent: 38, dependent conditional: 6, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 246, independent: 208, independent conditional: 12, independent unconditional: 196, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 246, independent: 208, independent conditional: 12, independent unconditional: 196, dependent: 38, dependent conditional: 0, dependent unconditional: 38, 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: 246, independent: 208, independent conditional: 12, independent unconditional: 196, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 450, Positive cache size: 403, Positive conditional cache size: 23, Positive unconditional cache size: 380, Negative cache size: 47, Negative conditional cache size: 10, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 1834 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 322, independent: 272, independent conditional: 272, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 322, independent: 272, independent conditional: 29, independent unconditional: 243, dependent: 50, dependent conditional: 6, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 322, independent: 272, independent conditional: 21, independent unconditional: 251, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 322, independent: 272, independent conditional: 21, independent unconditional: 251, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 322, independent: 269, independent conditional: 21, independent unconditional: 248, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 453, Positive cache size: 406, Positive conditional cache size: 23, Positive unconditional cache size: 383, Negative cache size: 47, Negative conditional cache size: 10, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 67 PlacesBefore, 66 PlacesAfterwards, 90 TransitionsBefore, 89 TransitionsAfterwards, 2876 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 362, independent: 350, independent conditional: 350, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 362, independent: 350, independent conditional: 221, independent unconditional: 129, dependent: 12, dependent conditional: 8, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 362, independent: 350, independent conditional: 214, independent unconditional: 136, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 362, independent: 350, independent conditional: 214, independent unconditional: 136, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 23, independent conditional: 8, independent unconditional: 15, 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: 23, independent: 23, independent conditional: 0, independent unconditional: 23, 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: 362, independent: 327, independent conditional: 206, independent unconditional: 121, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 23, unknown conditional: 8, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 524, Positive cache size: 477, Positive conditional cache size: 31, Positive unconditional cache size: 446, Negative cache size: 47, Negative conditional cache size: 10, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 70 PlacesBefore, 70 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 2636 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 136, independent: 124, independent conditional: 124, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 136, independent: 124, independent conditional: 55, independent unconditional: 69, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 136, independent: 124, independent conditional: 41, independent unconditional: 83, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 136, independent: 124, independent conditional: 41, independent unconditional: 83, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 136, independent: 115, independent conditional: 41, independent unconditional: 74, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 535, Positive cache size: 487, Positive conditional cache size: 31, Positive unconditional cache size: 456, Negative cache size: 48, Negative conditional cache size: 10, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 77 PlacesBefore, 76 PlacesAfterwards, 111 TransitionsBefore, 110 TransitionsAfterwards, 3260 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 211, independent: 199, independent conditional: 199, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 211, independent: 199, independent conditional: 142, independent unconditional: 57, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 215, independent: 199, independent conditional: 131, independent unconditional: 68, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 215, independent: 199, independent conditional: 131, independent unconditional: 68, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 215, independent: 194, independent conditional: 126, independent unconditional: 68, dependent: 15, dependent conditional: 3, dependent unconditional: 12, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 564, Positive cache size: 515, Positive conditional cache size: 36, Positive unconditional cache size: 479, Negative cache size: 49, Negative conditional cache size: 11, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 82 PlacesBefore, 82 PlacesAfterwards, 124 TransitionsBefore, 124 TransitionsAfterwards, 3546 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, independent: 70, independent conditional: 70, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 76, independent: 70, independent conditional: 46, independent unconditional: 24, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 80, independent: 70, independent conditional: 44, independent unconditional: 26, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 80, independent: 70, independent conditional: 44, independent unconditional: 26, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, independent: 70, independent conditional: 44, independent unconditional: 26, dependent: 9, dependent conditional: 3, dependent unconditional: 6, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 565, Positive cache size: 515, Positive conditional cache size: 36, Positive unconditional cache size: 479, Negative cache size: 50, Negative conditional cache size: 12, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 88 PlacesBefore, 87 PlacesAfterwards, 125 TransitionsBefore, 124 TransitionsAfterwards, 3564 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 212, independent: 200, independent conditional: 200, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 212, independent: 200, independent conditional: 140, independent unconditional: 60, dependent: 12, dependent conditional: 6, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 218, independent: 200, independent conditional: 98, independent unconditional: 102, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 218, independent: 200, independent conditional: 98, independent unconditional: 102, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 13, independent conditional: 1, independent unconditional: 12, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 218, independent: 187, independent conditional: 97, independent unconditional: 90, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 14, unknown conditional: 1, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 628, Positive cache size: 577, Positive conditional cache size: 44, Positive unconditional cache size: 533, Negative cache size: 51, Negative conditional cache size: 12, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 54, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 86 PlacesBefore, 84 PlacesAfterwards, 104 TransitionsBefore, 102 TransitionsAfterwards, 2334 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 112, independent: 104, independent conditional: 104, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 112, independent: 104, independent conditional: 76, independent unconditional: 28, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 112, independent: 104, independent conditional: 76, independent unconditional: 28, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 112, independent: 104, independent conditional: 76, independent unconditional: 28, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 112, independent: 101, independent conditional: 73, independent unconditional: 28, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 643, Positive cache size: 592, Positive conditional cache size: 47, Positive unconditional cache size: 545, Negative cache size: 51, Negative conditional cache size: 12, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 82 PlacesBefore, 82 PlacesAfterwards, 104 TransitionsBefore, 104 TransitionsAfterwards, 2374 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 104, independent: 98, independent conditional: 98, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 104, independent: 98, independent conditional: 77, independent unconditional: 21, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 104, independent: 98, independent conditional: 76, independent unconditional: 22, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 104, independent: 98, independent conditional: 76, independent unconditional: 22, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 18, independent unconditional: 2, 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: 20, independent: 20, independent conditional: 0, independent unconditional: 20, 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: 104, independent: 78, independent conditional: 58, independent unconditional: 20, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 20, unknown conditional: 18, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 672, Positive cache size: 621, Positive conditional cache size: 66, Positive unconditional cache size: 555, Negative cache size: 51, Negative conditional cache size: 12, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 89 PlacesBefore, 87 PlacesAfterwards, 112 TransitionsBefore, 110 TransitionsAfterwards, 2680 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 147, independent: 143, independent conditional: 143, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 147, independent: 143, independent conditional: 127, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 147, independent: 143, independent conditional: 126, independent unconditional: 17, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 147, independent: 143, independent conditional: 126, independent unconditional: 17, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 147, independent: 140, independent conditional: 123, independent unconditional: 17, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 704, Positive cache size: 653, Positive conditional cache size: 70, Positive unconditional cache size: 583, Negative cache size: 51, Negative conditional cache size: 12, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 84 PlacesBefore, 83 PlacesAfterwards, 83 TransitionsBefore, 82 TransitionsAfterwards, 1304 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 188, independent: 188, independent conditional: 188, 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: 188, independent: 188, independent conditional: 159, independent unconditional: 29, 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: 188, independent: 188, independent conditional: 158, independent unconditional: 30, 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: 188, independent: 188, independent conditional: 158, independent unconditional: 30, 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: 44, independent: 44, independent conditional: 32, independent unconditional: 12, 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: 44, independent: 44, independent conditional: 0, independent unconditional: 44, 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: 188, independent: 144, independent conditional: 126, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 44, unknown conditional: 32, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 776, Positive cache size: 725, Positive conditional cache size: 105, Positive unconditional cache size: 620, Negative cache size: 51, Negative conditional cache size: 12, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool b$flush_delayed; [L726] 0 int b$mem_tmp; [L727] 0 _Bool b$r_buff0_thd0; [L728] 0 _Bool b$r_buff0_thd1; [L729] 0 _Bool b$r_buff0_thd2; [L730] 0 _Bool b$r_buff0_thd3; [L731] 0 _Bool b$r_buff0_thd4; [L732] 0 _Bool b$r_buff1_thd0; [L733] 0 _Bool b$r_buff1_thd1; [L734] 0 _Bool b$r_buff1_thd2; [L735] 0 _Bool b$r_buff1_thd3; [L736] 0 _Bool b$r_buff1_thd4; [L737] 0 _Bool b$read_delayed; [L738] 0 int *b$read_delayed_var; [L739] 0 int b$w_buff0; [L740] 0 _Bool b$w_buff0_used; [L741] 0 int b$w_buff1; [L742] 0 _Bool b$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t937; [L874] FCALL, FORK 0 pthread_create(&t937, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t937, ((void *)0), P0, ((void *)0))=-3, t937={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t938; [L876] FCALL, FORK 0 pthread_create(&t938, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t938, ((void *)0), P1, ((void *)0))=-2, t937={5:0}, t938={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t939; [L878] FCALL, FORK 0 pthread_create(&t939, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t939, ((void *)0), P2, ((void *)0))=-1, t937={5:0}, t938={6:0}, t939={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L879] 0 pthread_t t940; [L880] FCALL, FORK 0 pthread_create(&t940, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t940, ((void *)0), P3, ((void *)0))=0, t937={5:0}, t938={6:0}, t939={7:0}, t940={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 b$w_buff1 = b$w_buff0 [L757] 1 b$w_buff0 = 1 [L758] 1 b$w_buff1_used = b$w_buff0_used [L759] 1 b$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L761] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L762] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L763] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L764] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L765] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L766] 1 b$r_buff0_thd1 = (_Bool)1 [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 [L789] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L806] 3 y = 1 [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L812] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L813] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L814] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L815] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L816] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L826] 4 z = 1 [L829] 4 a = 1 [L832] 4 __unbuffered_p3_EAX = a [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 b$flush_delayed = weak$$choice2 [L838] 4 b$mem_tmp = b [L839] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L840] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L841] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L842] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L843] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L845] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = b [L847] 4 b = b$flush_delayed ? b$mem_tmp : b [L848] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] [L851] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L852] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L853] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L854] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L855] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] [L772] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L773] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L774] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L775] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L776] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L887] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L888] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L889] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L890] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L895] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 172 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: 104.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 80.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 809 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 809 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2411 IncrementalHoareTripleChecker+Invalid, 2570 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 159 mSolverCounterUnsat, 20 mSDtfsCounter, 2411 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=835occurred in iteration=10, InterpolantAutomatonStates: 69, 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.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 278 NumberOfCodeBlocks, 278 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 243 ConstructedInterpolants, 0 QuantifiedInterpolants, 1932 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 RESULT: Ultimate proved your program to be incorrect! [2022-12-13 11:53:48,269 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...