/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/mix008.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:45:24,192 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:45:24,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:45:24,225 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:45:24,225 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:45:24,227 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:45:24,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:45:24,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:45:24,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:45:24,239 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:45:24,240 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:45:24,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:45:24,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:45:24,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:45:24,244 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:45:24,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:45:24,247 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:45:24,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:45:24,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:45:24,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:45:24,253 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:45:24,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:45:24,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:45:24,256 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:45:24,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:45:24,261 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:45:24,261 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:45:24,263 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:45:24,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:45:24,263 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:45:24,264 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:45:24,265 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:45:24,266 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:45:24,266 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:45:24,267 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:45:24,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:45:24,267 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:45:24,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:45:24,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:45:24,268 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:45:24,292 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:45:24,293 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:45:24,317 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:45:24,317 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:45:24,319 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:45:24,319 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:45:24,319 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:45:24,320 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:45:24,320 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:45:24,320 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:45:24,320 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:45:24,320 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:45:24,321 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:45:24,321 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:45:24,321 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:45:24,321 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:45:24,321 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:45:24,321 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:45:24,321 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:45:24,321 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:45:24,322 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:45:24,322 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:45:24,322 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:45:24,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:45:24,322 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:45:24,322 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:45:24,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:45:24,322 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:45:24,322 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:45:24,322 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:45:24,322 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:45:24,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:45:24,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:45:24,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:45:24,570 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:45:24,571 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:45:24,577 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008.opt.i [2022-12-13 11:45:25,527 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:45:25,749 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:45:25,750 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008.opt.i [2022-12-13 11:45:25,766 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10bf5ae4e/19e3bddb9afe4f68bd32aadda40171cd/FLAGa9f329eed [2022-12-13 11:45:25,781 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10bf5ae4e/19e3bddb9afe4f68bd32aadda40171cd [2022-12-13 11:45:25,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:45:25,784 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:45:25,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:45:25,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:45:25,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:45:25,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:45:25" (1/1) ... [2022-12-13 11:45:25,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63251898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:45:25, skipping insertion in model container [2022-12-13 11:45:25,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:45:25" (1/1) ... [2022-12-13 11:45:25,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:45:25,823 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:45:25,921 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/mix008.opt.i[944,957] [2022-12-13 11:45:26,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:45:26,120 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:45:26,130 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/mix008.opt.i[944,957] [2022-12-13 11:45:26,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:45:26,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:45:26,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:45:26,218 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:45:26,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:45:26 WrapperNode [2022-12-13 11:45:26,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:45:26,220 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:45:26,220 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:45:26,220 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:45:26,225 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:45:26" (1/1) ... [2022-12-13 11:45:26,251 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:45:26" (1/1) ... [2022-12-13 11:45:26,283 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2022-12-13 11:45:26,283 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:45:26,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:45:26,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:45:26,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:45:26,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:45:26" (1/1) ... [2022-12-13 11:45:26,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:45:26" (1/1) ... [2022-12-13 11:45:26,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:45:26" (1/1) ... [2022-12-13 11:45:26,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:45:26" (1/1) ... [2022-12-13 11:45:26,313 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:45:26" (1/1) ... [2022-12-13 11:45:26,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:45:26" (1/1) ... [2022-12-13 11:45:26,316 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:45:26" (1/1) ... [2022-12-13 11:45:26,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:45:26" (1/1) ... [2022-12-13 11:45:26,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:45:26,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:45:26,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:45:26,319 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:45:26,320 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:45:26" (1/1) ... [2022-12-13 11:45:26,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:45:26,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:45:26,369 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:45:26,387 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:45:26,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:45:26,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:45:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:45:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:45:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:45:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:45:26,396 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:45:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:45:26,396 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:45:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:45:26,396 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:45:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 11:45:26,396 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 11:45:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:45:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:45:26,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:45:26,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:45:26,397 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:45:26,486 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:45:26,487 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:45:26,763 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:45:26,892 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:45:26,893 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:45:26,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:45:26 BoogieIcfgContainer [2022-12-13 11:45:26,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:45:26,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:45:26,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:45:26,899 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:45:26,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:45:25" (1/3) ... [2022-12-13 11:45:26,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c88b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:45:26, skipping insertion in model container [2022-12-13 11:45:26,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:45:26" (2/3) ... [2022-12-13 11:45:26,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c88b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:45:26, skipping insertion in model container [2022-12-13 11:45:26,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:45:26" (3/3) ... [2022-12-13 11:45:26,901 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008.opt.i [2022-12-13 11:45:26,932 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:45:26,932 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:45:26,932 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:45:26,988 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:45:27,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2022-12-13 11:45:27,082 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-13 11:45:27,083 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:45:27,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-13 11:45:27,089 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2022-12-13 11:45:27,096 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2022-12-13 11:45:27,097 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:45:27,110 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-13 11:45:27,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2022-12-13 11:45:27,137 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-13 11:45:27,138 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:45:27,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-13 11:45:27,141 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-13 11:45:27,141 INFO L226 LiptonReduction]: Number of co-enabled transitions 2836 [2022-12-13 11:45:31,850 INFO L241 LiptonReduction]: Total number of compositions: 100 [2022-12-13 11:45:31,879 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:45:31,884 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;@379f7558, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:45:31,884 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 11:45:31,898 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-13 11:45:31,898 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:45:31,898 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:45:31,899 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:45:31,899 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:45:31,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:45:31,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1999993492, now seen corresponding path program 1 times [2022-12-13 11:45:31,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:45:31,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195115800] [2022-12-13 11:45:31,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:45:31,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:45:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:32,378 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:45:32,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:45:32,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195115800] [2022-12-13 11:45:32,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195115800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:45:32,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:45:32,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:45:32,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144321802] [2022-12-13 11:45:32,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:45:32,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:45:32,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:45:32,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:45:32,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:45:32,405 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 67 [2022-12-13 11:45:32,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 67 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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:45:32,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:45:32,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 67 [2022-12-13 11:45:32,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:45:36,398 INFO L130 PetriNetUnfolder]: 40551/58271 cut-off events. [2022-12-13 11:45:36,399 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-13 11:45:36,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112191 conditions, 58271 events. 40551/58271 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 3408. Compared 446232 event pairs, 5311 based on Foata normal form. 0/35848 useless extension candidates. Maximal degree in co-relation 112179. Up to 46041 conditions per place. [2022-12-13 11:45:36,546 INFO L137 encePairwiseOnDemand]: 61/67 looper letters, 37 selfloop transitions, 2 changer transitions 46/99 dead transitions. [2022-12-13 11:45:36,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 99 transitions, 380 flow [2022-12-13 11:45:36,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:45:36,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:45:36,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2022-12-13 11:45:36,555 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 11:45:36,556 INFO L175 Difference]: Start difference. First operand has 79 places, 67 transitions, 146 flow. Second operand 3 states and 134 transitions. [2022-12-13 11:45:36,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 99 transitions, 380 flow [2022-12-13 11:45:36,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 99 transitions, 376 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 11:45:36,564 INFO L231 Difference]: Finished difference. Result has 74 places, 40 transitions, 92 flow [2022-12-13 11:45:36,565 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=74, PETRI_TRANSITIONS=40} [2022-12-13 11:45:36,568 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -5 predicate places. [2022-12-13 11:45:36,568 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:45:36,568 INFO L89 Accepts]: Start accepts. Operand has 74 places, 40 transitions, 92 flow [2022-12-13 11:45:36,571 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:45:36,571 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:45:36,571 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 40 transitions, 92 flow [2022-12-13 11:45:36,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 40 transitions, 92 flow [2022-12-13 11:45:36,578 INFO L130 PetriNetUnfolder]: 0/40 cut-off events. [2022-12-13 11:45:36,578 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:45:36,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 84 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 11:45:36,583 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 40 transitions, 92 flow [2022-12-13 11:45:36,583 INFO L226 LiptonReduction]: Number of co-enabled transitions 962 [2022-12-13 11:45:36,712 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:45:36,714 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 11:45:36,714 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 92 flow [2022-12-13 11:45:36,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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:45:36,714 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:45:36,714 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:45:36,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:45:36,717 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:45:36,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:45:36,718 INFO L85 PathProgramCache]: Analyzing trace with hash -2143256155, now seen corresponding path program 1 times [2022-12-13 11:45:36,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:45:36,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427850031] [2022-12-13 11:45:36,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:45:36,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:45:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:36,854 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:45:36,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:45:36,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427850031] [2022-12-13 11:45:36,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427850031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:45:36,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:45:36,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:45:36,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990205825] [2022-12-13 11:45:36,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:45:36,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:45:36,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:45:36,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:45:36,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:45:36,856 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2022-12-13 11:45:36,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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:45:36,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:45:36,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2022-12-13 11:45:36,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:45:37,486 INFO L130 PetriNetUnfolder]: 6935/10175 cut-off events. [2022-12-13 11:45:37,487 INFO L131 PetriNetUnfolder]: For 272/272 co-relation queries the response was YES. [2022-12-13 11:45:37,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20077 conditions, 10175 events. 6935/10175 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 62829 event pairs, 2295 based on Foata normal form. 0/7736 useless extension candidates. Maximal degree in co-relation 20067. Up to 6481 conditions per place. [2022-12-13 11:45:37,529 INFO L137 encePairwiseOnDemand]: 37/40 looper letters, 36 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2022-12-13 11:45:37,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 53 transitions, 198 flow [2022-12-13 11:45:37,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:45:37,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:45:37,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-12-13 11:45:37,530 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 11:45:37,531 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 92 flow. Second operand 3 states and 80 transitions. [2022-12-13 11:45:37,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 53 transitions, 198 flow [2022-12-13 11:45:37,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 53 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:45:37,534 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 94 flow [2022-12-13 11:45:37,534 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2022-12-13 11:45:37,535 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -27 predicate places. [2022-12-13 11:45:37,535 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:45:37,535 INFO L89 Accepts]: Start accepts. Operand has 52 places, 39 transitions, 94 flow [2022-12-13 11:45:37,536 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:45:37,536 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:45:37,536 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 39 transitions, 94 flow [2022-12-13 11:45:37,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 39 transitions, 94 flow [2022-12-13 11:45:37,539 INFO L130 PetriNetUnfolder]: 0/39 cut-off events. [2022-12-13 11:45:37,539 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:45:37,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 84 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 11:45:37,540 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 39 transitions, 94 flow [2022-12-13 11:45:37,540 INFO L226 LiptonReduction]: Number of co-enabled transitions 902 [2022-12-13 11:45:37,553 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:45:37,554 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 11:45:37,554 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 94 flow [2022-12-13 11:45:37,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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:45:37,554 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:45:37,554 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:45:37,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:45:37,555 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:45:37,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:45:37,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1828374635, now seen corresponding path program 1 times [2022-12-13 11:45:37,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:45:37,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117686301] [2022-12-13 11:45:37,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:45:37,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:45:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:37,695 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:45:37,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:45:37,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117686301] [2022-12-13 11:45:37,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117686301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:45:37,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:45:37,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:45:37,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135173327] [2022-12-13 11:45:37,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:45:37,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:45:37,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:45:37,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:45:37,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:45:37,697 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2022-12-13 11:45:37,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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:45:37,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:45:37,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2022-12-13 11:45:37,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:45:39,188 INFO L130 PetriNetUnfolder]: 17897/25900 cut-off events. [2022-12-13 11:45:39,188 INFO L131 PetriNetUnfolder]: For 1772/1772 co-relation queries the response was YES. [2022-12-13 11:45:39,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52599 conditions, 25900 events. 17897/25900 cut-off events. For 1772/1772 co-relation queries the response was YES. Maximal size of possible extension queue 932. Compared 163095 event pairs, 3429 based on Foata normal form. 670/21674 useless extension candidates. Maximal degree in co-relation 52588. Up to 11848 conditions per place. [2022-12-13 11:45:39,289 INFO L137 encePairwiseOnDemand]: 30/39 looper letters, 61 selfloop transitions, 8 changer transitions 0/78 dead transitions. [2022-12-13 11:45:39,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 78 transitions, 320 flow [2022-12-13 11:45:39,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:45:39,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:45:39,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-12-13 11:45:39,290 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6858974358974359 [2022-12-13 11:45:39,290 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 94 flow. Second operand 4 states and 107 transitions. [2022-12-13 11:45:39,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 78 transitions, 320 flow [2022-12-13 11:45:39,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 78 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:45:39,297 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 151 flow [2022-12-13 11:45:39,297 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2022-12-13 11:45:39,298 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -24 predicate places. [2022-12-13 11:45:39,298 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:45:39,298 INFO L89 Accepts]: Start accepts. Operand has 55 places, 45 transitions, 151 flow [2022-12-13 11:45:39,299 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:45:39,299 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:45:39,299 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 45 transitions, 151 flow [2022-12-13 11:45:39,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 45 transitions, 151 flow [2022-12-13 11:45:39,329 INFO L130 PetriNetUnfolder]: 150/489 cut-off events. [2022-12-13 11:45:39,329 INFO L131 PetriNetUnfolder]: For 128/139 co-relation queries the response was YES. [2022-12-13 11:45:39,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 489 events. 150/489 cut-off events. For 128/139 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3291 event pairs, 57 based on Foata normal form. 0/330 useless extension candidates. Maximal degree in co-relation 934. Up to 170 conditions per place. [2022-12-13 11:45:39,334 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 45 transitions, 151 flow [2022-12-13 11:45:39,334 INFO L226 LiptonReduction]: Number of co-enabled transitions 1074 [2022-12-13 11:45:39,353 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:45:39,354 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-13 11:45:39,354 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 151 flow [2022-12-13 11:45:39,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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:45:39,354 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:45:39,354 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:45:39,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:45:39,354 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:45:39,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:45:39,355 INFO L85 PathProgramCache]: Analyzing trace with hash -2095530331, now seen corresponding path program 1 times [2022-12-13 11:45:39,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:45:39,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436217077] [2022-12-13 11:45:39,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:45:39,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:45:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:39,494 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:45:39,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:45:39,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436217077] [2022-12-13 11:45:39,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436217077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:45:39,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:45:39,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:45:39,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184101290] [2022-12-13 11:45:39,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:45:39,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:45:39,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:45:39,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:45:39,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:45:39,496 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2022-12-13 11:45:39,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 151 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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:45:39,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:45:39,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2022-12-13 11:45:39,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:45:41,258 INFO L130 PetriNetUnfolder]: 20100/28997 cut-off events. [2022-12-13 11:45:41,258 INFO L131 PetriNetUnfolder]: For 12083/12083 co-relation queries the response was YES. [2022-12-13 11:45:41,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70266 conditions, 28997 events. 20100/28997 cut-off events. For 12083/12083 co-relation queries the response was YES. Maximal size of possible extension queue 1044. Compared 184856 event pairs, 2644 based on Foata normal form. 40/23690 useless extension candidates. Maximal degree in co-relation 70252. Up to 15308 conditions per place. [2022-12-13 11:45:41,411 INFO L137 encePairwiseOnDemand]: 29/39 looper letters, 66 selfloop transitions, 17 changer transitions 0/92 dead transitions. [2022-12-13 11:45:41,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 92 transitions, 455 flow [2022-12-13 11:45:41,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:45:41,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:45:41,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-12-13 11:45:41,413 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7307692307692307 [2022-12-13 11:45:41,413 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 151 flow. Second operand 4 states and 114 transitions. [2022-12-13 11:45:41,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 92 transitions, 455 flow [2022-12-13 11:45:41,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 451 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:45:41,441 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 275 flow [2022-12-13 11:45:41,441 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=275, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2022-12-13 11:45:41,442 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -19 predicate places. [2022-12-13 11:45:41,442 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:45:41,443 INFO L89 Accepts]: Start accepts. Operand has 60 places, 55 transitions, 275 flow [2022-12-13 11:45:41,444 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:45:41,444 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:45:41,444 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 55 transitions, 275 flow [2022-12-13 11:45:41,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 55 transitions, 275 flow [2022-12-13 11:45:41,482 INFO L130 PetriNetUnfolder]: 215/675 cut-off events. [2022-12-13 11:45:41,482 INFO L131 PetriNetUnfolder]: For 576/641 co-relation queries the response was YES. [2022-12-13 11:45:41,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1743 conditions, 675 events. 215/675 cut-off events. For 576/641 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4845 event pairs, 75 based on Foata normal form. 1/470 useless extension candidates. Maximal degree in co-relation 1728. Up to 197 conditions per place. [2022-12-13 11:45:41,488 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 55 transitions, 275 flow [2022-12-13 11:45:41,488 INFO L226 LiptonReduction]: Number of co-enabled transitions 1376 [2022-12-13 11:45:41,494 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:45:41,499 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-13 11:45:41,499 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 275 flow [2022-12-13 11:45:41,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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:45:41,499 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:45:41,500 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:45:41,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:45:41,500 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:45:41,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:45:41,500 INFO L85 PathProgramCache]: Analyzing trace with hash -279866391, now seen corresponding path program 1 times [2022-12-13 11:45:41,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:45:41,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018460712] [2022-12-13 11:45:41,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:45:41,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:45:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:41,640 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:45:41,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:45:41,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018460712] [2022-12-13 11:45:41,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018460712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:45:41,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:45:41,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:45:41,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728564553] [2022-12-13 11:45:41,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:45:41,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:45:41,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:45:41,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:45:41,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:45:41,649 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2022-12-13 11:45:41,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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:45:41,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:45:41,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2022-12-13 11:45:41,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:45:44,602 INFO L130 PetriNetUnfolder]: 30356/42364 cut-off events. [2022-12-13 11:45:44,602 INFO L131 PetriNetUnfolder]: For 43445/44226 co-relation queries the response was YES. [2022-12-13 11:45:44,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109542 conditions, 42364 events. 30356/42364 cut-off events. For 43445/44226 co-relation queries the response was YES. Maximal size of possible extension queue 2191. Compared 278155 event pairs, 9968 based on Foata normal form. 311/27311 useless extension candidates. Maximal degree in co-relation 109524. Up to 40828 conditions per place. [2022-12-13 11:45:44,811 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 56 selfloop transitions, 13 changer transitions 0/87 dead transitions. [2022-12-13 11:45:44,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 87 transitions, 544 flow [2022-12-13 11:45:44,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:45:44,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:45:44,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2022-12-13 11:45:44,813 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7094017094017094 [2022-12-13 11:45:44,813 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 275 flow. Second operand 3 states and 83 transitions. [2022-12-13 11:45:44,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 87 transitions, 544 flow [2022-12-13 11:45:44,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 87 transitions, 544 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 11:45:44,822 INFO L231 Difference]: Finished difference. Result has 63 places, 67 transitions, 364 flow [2022-12-13 11:45:44,823 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=63, PETRI_TRANSITIONS=67} [2022-12-13 11:45:44,824 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -16 predicate places. [2022-12-13 11:45:44,825 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:45:44,825 INFO L89 Accepts]: Start accepts. Operand has 63 places, 67 transitions, 364 flow [2022-12-13 11:45:44,826 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:45:44,826 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:45:44,826 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 67 transitions, 364 flow [2022-12-13 11:45:44,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 67 transitions, 364 flow [2022-12-13 11:45:45,374 INFO L130 PetriNetUnfolder]: 7377/12678 cut-off events. [2022-12-13 11:45:45,375 INFO L131 PetriNetUnfolder]: For 4125/4299 co-relation queries the response was YES. [2022-12-13 11:45:45,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27489 conditions, 12678 events. 7377/12678 cut-off events. For 4125/4299 co-relation queries the response was YES. Maximal size of possible extension queue 1616. Compared 110154 event pairs, 3747 based on Foata normal form. 24/6211 useless extension candidates. Maximal degree in co-relation 27471. Up to 10462 conditions per place. [2022-12-13 11:45:45,490 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 67 transitions, 364 flow [2022-12-13 11:45:45,490 INFO L226 LiptonReduction]: Number of co-enabled transitions 1826 [2022-12-13 11:45:45,754 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:45:45,755 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 930 [2022-12-13 11:45:45,755 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 67 transitions, 364 flow [2022-12-13 11:45:45,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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:45:45,755 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:45:45,755 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:45:45,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:45:45,755 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:45:45,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:45:45,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1265173524, now seen corresponding path program 1 times [2022-12-13 11:45:45,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:45:45,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129527340] [2022-12-13 11:45:45,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:45:45,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:45:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:45,914 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:45:45,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:45:45,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129527340] [2022-12-13 11:45:45,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129527340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:45:45,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:45:45,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:45:45,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617446323] [2022-12-13 11:45:45,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:45:45,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:45:45,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:45:45,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:45:45,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:45:45,917 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2022-12-13 11:45:45,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 67 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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:45:45,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:45:45,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2022-12-13 11:45:45,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:45:50,402 INFO L130 PetriNetUnfolder]: 48680/68658 cut-off events. [2022-12-13 11:45:50,402 INFO L131 PetriNetUnfolder]: For 86472/88216 co-relation queries the response was YES. [2022-12-13 11:45:50,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218744 conditions, 68658 events. 48680/68658 cut-off events. For 86472/88216 co-relation queries the response was YES. Maximal size of possible extension queue 2727. Compared 471572 event pairs, 15159 based on Foata normal form. 885/54054 useless extension candidates. Maximal degree in co-relation 218723. Up to 42671 conditions per place. [2022-12-13 11:45:50,765 INFO L137 encePairwiseOnDemand]: 29/39 looper letters, 101 selfloop transitions, 22 changer transitions 0/136 dead transitions. [2022-12-13 11:45:50,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 136 transitions, 942 flow [2022-12-13 11:45:50,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:45:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:45:50,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2022-12-13 11:45:50,767 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7435897435897436 [2022-12-13 11:45:50,767 INFO L175 Difference]: Start difference. First operand has 63 places, 67 transitions, 364 flow. Second operand 4 states and 116 transitions. [2022-12-13 11:45:50,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 136 transitions, 942 flow [2022-12-13 11:45:50,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 136 transitions, 913 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:45:50,774 INFO L231 Difference]: Finished difference. Result has 68 places, 80 transitions, 573 flow [2022-12-13 11:45:50,774 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=573, PETRI_PLACES=68, PETRI_TRANSITIONS=80} [2022-12-13 11:45:50,774 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -11 predicate places. [2022-12-13 11:45:50,775 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:45:50,775 INFO L89 Accepts]: Start accepts. Operand has 68 places, 80 transitions, 573 flow [2022-12-13 11:45:50,775 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:45:50,776 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:45:50,776 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 80 transitions, 573 flow [2022-12-13 11:45:50,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 80 transitions, 573 flow [2022-12-13 11:45:51,837 INFO L130 PetriNetUnfolder]: 12849/21167 cut-off events. [2022-12-13 11:45:51,837 INFO L131 PetriNetUnfolder]: For 6715/7068 co-relation queries the response was YES. [2022-12-13 11:45:51,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45014 conditions, 21167 events. 12849/21167 cut-off events. For 6715/7068 co-relation queries the response was YES. Maximal size of possible extension queue 2538. Compared 188347 event pairs, 7070 based on Foata normal form. 32/9539 useless extension candidates. Maximal degree in co-relation 44992. Up to 18697 conditions per place. [2022-12-13 11:45:52,010 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 80 transitions, 573 flow [2022-12-13 11:45:52,010 INFO L226 LiptonReduction]: Number of co-enabled transitions 2276 [2022-12-13 11:45:52,139 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:45:52,139 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1364 [2022-12-13 11:45:52,139 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 80 transitions, 573 flow [2022-12-13 11:45:52,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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:45:52,140 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:45:52,140 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:45:52,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:45:52,140 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:45:52,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:45:52,140 INFO L85 PathProgramCache]: Analyzing trace with hash -422258022, now seen corresponding path program 1 times [2022-12-13 11:45:52,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:45:52,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516279758] [2022-12-13 11:45:52,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:45:52,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:45:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:52,242 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:45:52,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:45:52,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516279758] [2022-12-13 11:45:52,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516279758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:45:52,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:45:52,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:45:52,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444640892] [2022-12-13 11:45:52,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:45:52,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:45:52,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:45:52,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:45:52,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:45:52,243 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2022-12-13 11:45:52,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 80 transitions, 573 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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:45:52,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:45:52,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2022-12-13 11:45:52,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:45:55,440 INFO L130 PetriNetUnfolder]: 32002/47151 cut-off events. [2022-12-13 11:45:55,440 INFO L131 PetriNetUnfolder]: For 79654/82045 co-relation queries the response was YES. [2022-12-13 11:45:55,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156689 conditions, 47151 events. 32002/47151 cut-off events. For 79654/82045 co-relation queries the response was YES. Maximal size of possible extension queue 2613. Compared 349518 event pairs, 5316 based on Foata normal form. 1709/30971 useless extension candidates. Maximal degree in co-relation 156664. Up to 42085 conditions per place. [2022-12-13 11:45:55,681 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 88 selfloop transitions, 25 changer transitions 1/138 dead transitions. [2022-12-13 11:45:55,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 138 transitions, 1213 flow [2022-12-13 11:45:55,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:45:55,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:45:55,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-12-13 11:45:55,682 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7371794871794872 [2022-12-13 11:45:55,682 INFO L175 Difference]: Start difference. First operand has 68 places, 80 transitions, 573 flow. Second operand 4 states and 115 transitions. [2022-12-13 11:45:55,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 138 transitions, 1213 flow [2022-12-13 11:45:55,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 138 transitions, 1209 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-13 11:45:55,717 INFO L231 Difference]: Finished difference. Result has 72 places, 92 transitions, 717 flow [2022-12-13 11:45:55,717 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=717, PETRI_PLACES=72, PETRI_TRANSITIONS=92} [2022-12-13 11:45:55,717 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -7 predicate places. [2022-12-13 11:45:55,717 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:45:55,717 INFO L89 Accepts]: Start accepts. Operand has 72 places, 92 transitions, 717 flow [2022-12-13 11:45:55,718 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:45:55,718 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:45:55,719 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 92 transitions, 717 flow [2022-12-13 11:45:55,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 92 transitions, 717 flow [2022-12-13 11:45:56,778 INFO L130 PetriNetUnfolder]: 9267/16817 cut-off events. [2022-12-13 11:45:56,778 INFO L131 PetriNetUnfolder]: For 6932/17525 co-relation queries the response was YES. [2022-12-13 11:45:56,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51685 conditions, 16817 events. 9267/16817 cut-off events. For 6932/17525 co-relation queries the response was YES. Maximal size of possible extension queue 2313. Compared 160885 event pairs, 2309 based on Foata normal form. 59/8133 useless extension candidates. Maximal degree in co-relation 51660. Up to 14374 conditions per place. [2022-12-13 11:45:56,935 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 92 transitions, 717 flow [2022-12-13 11:45:56,937 INFO L226 LiptonReduction]: Number of co-enabled transitions 2854 [2022-12-13 11:45:57,036 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:45:57,036 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1319 [2022-12-13 11:45:57,036 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 92 transitions, 717 flow [2022-12-13 11:45:57,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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:45:57,037 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:45:57,037 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:45:57,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:45:57,037 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:45:57,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:45:57,037 INFO L85 PathProgramCache]: Analyzing trace with hash 984597754, now seen corresponding path program 1 times [2022-12-13 11:45:57,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:45:57,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882365070] [2022-12-13 11:45:57,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:45:57,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:45:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:57,172 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:45:57,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:45:57,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882365070] [2022-12-13 11:45:57,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882365070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:45:57,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:45:57,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:45:57,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082753569] [2022-12-13 11:45:57,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:45:57,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:45:57,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:45:57,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:45:57,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:45:57,174 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2022-12-13 11:45:57,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 92 transitions, 717 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 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:45:57,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:45:57,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2022-12-13 11:45:57,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:02,004 INFO L130 PetriNetUnfolder]: 42605/63176 cut-off events. [2022-12-13 11:46:02,004 INFO L131 PetriNetUnfolder]: For 159401/166315 co-relation queries the response was YES. [2022-12-13 11:46:02,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259105 conditions, 63176 events. 42605/63176 cut-off events. For 159401/166315 co-relation queries the response was YES. Maximal size of possible extension queue 3096. Compared 475978 event pairs, 6505 based on Foata normal form. 1929/52009 useless extension candidates. Maximal degree in co-relation 259077. Up to 38665 conditions per place. [2022-12-13 11:46:02,473 INFO L137 encePairwiseOnDemand]: 28/39 looper letters, 146 selfloop transitions, 44 changer transitions 4/211 dead transitions. [2022-12-13 11:46:02,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 211 transitions, 1924 flow [2022-12-13 11:46:02,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:46:02,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:46:02,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2022-12-13 11:46:02,474 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7435897435897436 [2022-12-13 11:46:02,474 INFO L175 Difference]: Start difference. First operand has 72 places, 92 transitions, 717 flow. Second operand 5 states and 145 transitions. [2022-12-13 11:46:02,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 211 transitions, 1924 flow [2022-12-13 11:46:02,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 211 transitions, 1794 flow, removed 32 selfloop flow, removed 2 redundant places. [2022-12-13 11:46:02,597 INFO L231 Difference]: Finished difference. Result has 77 places, 119 transitions, 1156 flow [2022-12-13 11:46:02,597 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1156, PETRI_PLACES=77, PETRI_TRANSITIONS=119} [2022-12-13 11:46:02,598 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -2 predicate places. [2022-12-13 11:46:02,598 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:02,598 INFO L89 Accepts]: Start accepts. Operand has 77 places, 119 transitions, 1156 flow [2022-12-13 11:46:02,606 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:02,606 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:02,607 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 119 transitions, 1156 flow [2022-12-13 11:46:02,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 119 transitions, 1156 flow [2022-12-13 11:46:04,095 INFO L130 PetriNetUnfolder]: 13100/23883 cut-off events. [2022-12-13 11:46:04,095 INFO L131 PetriNetUnfolder]: For 17194/24052 co-relation queries the response was YES. [2022-12-13 11:46:04,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69096 conditions, 23883 events. 13100/23883 cut-off events. For 17194/24052 co-relation queries the response was YES. Maximal size of possible extension queue 3327. Compared 240500 event pairs, 3330 based on Foata normal form. 116/11634 useless extension candidates. Maximal degree in co-relation 69068. Up to 19927 conditions per place. [2022-12-13 11:46:04,269 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 119 transitions, 1156 flow [2022-12-13 11:46:04,270 INFO L226 LiptonReduction]: Number of co-enabled transitions 3840 [2022-12-13 11:46:04,514 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:46:04,516 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1918 [2022-12-13 11:46:04,516 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 119 transitions, 1156 flow [2022-12-13 11:46:04,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 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:46:04,516 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:04,516 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:46:04,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:46:04,516 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:46:04,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:04,517 INFO L85 PathProgramCache]: Analyzing trace with hash -908679183, now seen corresponding path program 1 times [2022-12-13 11:46:04,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:04,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170355534] [2022-12-13 11:46:04,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:04,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:04,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:46:04,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:04,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170355534] [2022-12-13 11:46:04,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170355534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:04,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:04,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:46:04,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428389068] [2022-12-13 11:46:04,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:04,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:46:04,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:04,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:46:04,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:46:04,694 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2022-12-13 11:46:04,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 119 transitions, 1156 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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:46:04,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:04,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2022-12-13 11:46:04,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:07,724 INFO L130 PetriNetUnfolder]: 23206/35944 cut-off events. [2022-12-13 11:46:07,724 INFO L131 PetriNetUnfolder]: For 101757/106893 co-relation queries the response was YES. [2022-12-13 11:46:07,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145940 conditions, 35944 events. 23206/35944 cut-off events. For 101757/106893 co-relation queries the response was YES. Maximal size of possible extension queue 1890. Compared 279083 event pairs, 1220 based on Foata normal form. 3387/24605 useless extension candidates. Maximal degree in co-relation 145909. Up to 21529 conditions per place. [2022-12-13 11:46:07,911 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 132 selfloop transitions, 37 changer transitions 5/213 dead transitions. [2022-12-13 11:46:07,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 213 transitions, 2452 flow [2022-12-13 11:46:07,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:46:07,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:46:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2022-12-13 11:46:07,912 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7435897435897436 [2022-12-13 11:46:07,912 INFO L175 Difference]: Start difference. First operand has 77 places, 119 transitions, 1156 flow. Second operand 5 states and 145 transitions. [2022-12-13 11:46:07,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 213 transitions, 2452 flow [2022-12-13 11:46:07,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 213 transitions, 2436 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 11:46:07,971 INFO L231 Difference]: Finished difference. Result has 81 places, 131 transitions, 1340 flow [2022-12-13 11:46:07,971 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1340, PETRI_PLACES=81, PETRI_TRANSITIONS=131} [2022-12-13 11:46:07,972 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 2 predicate places. [2022-12-13 11:46:07,972 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:07,972 INFO L89 Accepts]: Start accepts. Operand has 81 places, 131 transitions, 1340 flow [2022-12-13 11:46:07,973 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:07,973 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:07,973 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 131 transitions, 1340 flow [2022-12-13 11:46:07,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 131 transitions, 1340 flow [2022-12-13 11:46:08,834 INFO L130 PetriNetUnfolder]: 7682/15378 cut-off events. [2022-12-13 11:46:08,835 INFO L131 PetriNetUnfolder]: For 11926/19991 co-relation queries the response was YES. [2022-12-13 11:46:08,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60199 conditions, 15378 events. 7682/15378 cut-off events. For 11926/19991 co-relation queries the response was YES. Maximal size of possible extension queue 1872. Compared 156124 event pairs, 516 based on Foata normal form. 115/7628 useless extension candidates. Maximal degree in co-relation 60169. Up to 12502 conditions per place. [2022-12-13 11:46:09,092 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 131 transitions, 1340 flow [2022-12-13 11:46:09,092 INFO L226 LiptonReduction]: Number of co-enabled transitions 3772 [2022-12-13 11:46:09,191 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:46:09,191 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1219 [2022-12-13 11:46:09,192 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 131 transitions, 1340 flow [2022-12-13 11:46:09,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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:46:09,192 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:09,192 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:46:09,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:46:09,192 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:46:09,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2031579999, now seen corresponding path program 1 times [2022-12-13 11:46:09,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:09,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224663292] [2022-12-13 11:46:09,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:09,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:09,320 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:46:09,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:09,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224663292] [2022-12-13 11:46:09,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224663292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:09,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:09,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:46:09,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074615192] [2022-12-13 11:46:09,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:09,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:46:09,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:09,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:46:09,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:46:09,323 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2022-12-13 11:46:09,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 131 transitions, 1340 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 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:46:09,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:09,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2022-12-13 11:46:09,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:11,065 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([387] L771-->L776: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][125], [Black: 190#(<= ~__unbuffered_p2_EAX~0 0), Black: 188#true, Black: 195#true, 145#true, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P3Thread1of1ForFork1InUse, Black: 204#(<= ~__unbuffered_cnt~0 0), 209#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 208#(= ~x~0 1), Black: 206#true, Black: 216#(<= ~__unbuffered_cnt~0 1), 223#(and (= ~a~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 120#L786true, Black: 220#(= ~a~0 1), Black: 221#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 172#true, Black: 231#(<= ~__unbuffered_cnt~0 2), 191#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 52#L874-3true, 227#true, 198#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 238#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 186#(<= ~__unbuffered_p3_EAX~0 0), 144#true]) [2022-12-13 11:46:11,066 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 11:46:11,066 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:46:11,066 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:46:11,066 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:46:11,066 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([387] L771-->L776: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][125], [Black: 190#(<= ~__unbuffered_p2_EAX~0 0), Black: 188#true, 114#P0EXITtrue, 145#true, P1Thread1of1ForFork2InUse, Black: 195#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, Black: 204#(<= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork1InUse, 209#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 208#(= ~x~0 1), Black: 206#true, Black: 216#(<= ~__unbuffered_cnt~0 1), 223#(and (= ~a~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 120#L786true, Black: 220#(= ~a~0 1), Black: 221#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 231#(<= ~__unbuffered_cnt~0 2), 191#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 52#L874-3true, 227#true, 198#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 186#(<= ~__unbuffered_p3_EAX~0 0), 238#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#true]) [2022-12-13 11:46:11,066 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 11:46:11,066 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:46:11,067 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:46:11,067 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:46:11,358 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([424] L771-->P1FINAL: Formula: (and (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= |v_P1Thread1of1ForFork2_#res.base_5| 0) (= |v_P1Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][163], [Black: 190#(<= ~__unbuffered_p2_EAX~0 0), Black: 188#true, P1Thread1of1ForFork2InUse, Black: 195#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, Black: 204#(<= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork1InUse, 209#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 208#(= ~x~0 1), 147#true, Black: 206#true, Black: 216#(<= ~__unbuffered_cnt~0 1), 223#(and (= ~a~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 120#L786true, Black: 220#(= ~a~0 1), Black: 221#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 172#true, Black: 231#(<= ~__unbuffered_cnt~0 2), 191#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 52#L874-3true, 227#true, 198#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 238#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 186#(<= ~__unbuffered_p3_EAX~0 0), 144#true]) [2022-12-13 11:46:11,358 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2022-12-13 11:46:11,358 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 11:46:11,358 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 11:46:11,358 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 11:46:11,359 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L771-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_109 (+ v_~__unbuffered_cnt~0_110 1)) (= |v_P1Thread1of1ForFork2_#res.base_15| 0) (= 0 |v_P1Thread1of1ForFork2_#res.offset_15|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][164], [Black: 190#(<= ~__unbuffered_p2_EAX~0 0), Black: 188#true, P1Thread1of1ForFork2InUse, Black: 195#true, P0Thread1of1ForFork0InUse, 91#P1EXITtrue, P2Thread1of1ForFork3InUse, Black: 204#(<= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork1InUse, 209#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 208#(= ~x~0 1), Black: 206#true, Black: 216#(<= ~__unbuffered_cnt~0 1), 223#(and (= ~a~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 120#L786true, Black: 220#(= ~a~0 1), Black: 221#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 172#true, Black: 231#(<= ~__unbuffered_cnt~0 2), 191#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 52#L874-3true, 227#true, 198#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 238#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 186#(<= ~__unbuffered_p3_EAX~0 0), 144#true]) [2022-12-13 11:46:11,359 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2022-12-13 11:46:11,359 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 11:46:11,359 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 11:46:11,359 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 11:46:11,390 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([424] L771-->P1FINAL: Formula: (and (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= |v_P1Thread1of1ForFork2_#res.base_5| 0) (= |v_P1Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][163], [Black: 190#(<= ~__unbuffered_p2_EAX~0 0), Black: 188#true, 114#P0EXITtrue, P1Thread1of1ForFork2InUse, Black: 195#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, Black: 204#(<= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork1InUse, 209#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 208#(= ~x~0 1), 147#true, Black: 206#true, Black: 216#(<= ~__unbuffered_cnt~0 1), 223#(and (= ~a~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 220#(= ~a~0 1), 120#L786true, Black: 221#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 231#(<= ~__unbuffered_cnt~0 2), 191#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 52#L874-3true, 227#true, 198#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 238#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 186#(<= ~__unbuffered_p3_EAX~0 0), 144#true]) [2022-12-13 11:46:11,391 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2022-12-13 11:46:11,391 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 11:46:11,391 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 11:46:11,391 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 11:46:11,391 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L771-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_109 (+ v_~__unbuffered_cnt~0_110 1)) (= |v_P1Thread1of1ForFork2_#res.base_15| 0) (= 0 |v_P1Thread1of1ForFork2_#res.offset_15|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][164], [Black: 190#(<= ~__unbuffered_p2_EAX~0 0), Black: 188#true, 114#P0EXITtrue, P1Thread1of1ForFork2InUse, Black: 195#true, P0Thread1of1ForFork0InUse, 91#P1EXITtrue, P2Thread1of1ForFork3InUse, Black: 204#(<= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork1InUse, 209#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 208#(= ~x~0 1), Black: 206#true, Black: 216#(<= ~__unbuffered_cnt~0 1), 223#(and (= ~a~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 220#(= ~a~0 1), 120#L786true, Black: 221#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 231#(<= ~__unbuffered_cnt~0 2), 191#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 52#L874-3true, 227#true, 198#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 238#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 186#(<= ~__unbuffered_p3_EAX~0 0), 144#true]) [2022-12-13 11:46:11,391 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2022-12-13 11:46:11,391 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 11:46:11,391 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 11:46:11,392 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 11:46:13,287 INFO L130 PetriNetUnfolder]: 29167/47210 cut-off events. [2022-12-13 11:46:13,288 INFO L131 PetriNetUnfolder]: For 153211/161455 co-relation queries the response was YES. [2022-12-13 11:46:13,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226460 conditions, 47210 events. 29167/47210 cut-off events. For 153211/161455 co-relation queries the response was YES. Maximal size of possible extension queue 3125. Compared 408772 event pairs, 3383 based on Foata normal form. 2769/38886 useless extension candidates. Maximal degree in co-relation 226427. Up to 30346 conditions per place. [2022-12-13 11:46:13,522 INFO L137 encePairwiseOnDemand]: 36/39 looper letters, 147 selfloop transitions, 7 changer transitions 12/209 dead transitions. [2022-12-13 11:46:13,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 209 transitions, 2285 flow [2022-12-13 11:46:13,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:46:13,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:46:13,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-12-13 11:46:13,523 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2022-12-13 11:46:13,523 INFO L175 Difference]: Start difference. First operand has 81 places, 131 transitions, 1340 flow. Second operand 4 states and 112 transitions. [2022-12-13 11:46:13,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 209 transitions, 2285 flow [2022-12-13 11:46:14,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 209 transitions, 2075 flow, removed 52 selfloop flow, removed 3 redundant places. [2022-12-13 11:46:14,476 INFO L231 Difference]: Finished difference. Result has 82 places, 127 transitions, 1207 flow [2022-12-13 11:46:14,476 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1207, PETRI_PLACES=82, PETRI_TRANSITIONS=127} [2022-12-13 11:46:14,476 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 3 predicate places. [2022-12-13 11:46:14,476 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:14,476 INFO L89 Accepts]: Start accepts. Operand has 82 places, 127 transitions, 1207 flow [2022-12-13 11:46:14,477 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:14,477 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:14,477 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 127 transitions, 1207 flow [2022-12-13 11:46:14,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 127 transitions, 1207 flow [2022-12-13 11:46:15,843 INFO L130 PetriNetUnfolder]: 11729/22726 cut-off events. [2022-12-13 11:46:15,843 INFO L131 PetriNetUnfolder]: For 20042/23409 co-relation queries the response was YES. [2022-12-13 11:46:15,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70525 conditions, 22726 events. 11729/22726 cut-off events. For 20042/23409 co-relation queries the response was YES. Maximal size of possible extension queue 3069. Compared 239872 event pairs, 864 based on Foata normal form. 102/11042 useless extension candidates. Maximal degree in co-relation 70495. Up to 15715 conditions per place. [2022-12-13 11:46:16,011 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 127 transitions, 1207 flow [2022-12-13 11:46:16,012 INFO L226 LiptonReduction]: Number of co-enabled transitions 3588 [2022-12-13 11:46:16,178 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:46:16,179 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1703 [2022-12-13 11:46:16,179 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 127 transitions, 1207 flow [2022-12-13 11:46:16,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 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:46:16,179 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:16,179 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:46:16,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:46:16,179 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:46:16,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:16,180 INFO L85 PathProgramCache]: Analyzing trace with hash -551345595, now seen corresponding path program 2 times [2022-12-13 11:46:16,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:16,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934342413] [2022-12-13 11:46:16,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:16,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:16,311 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:46:16,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:16,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934342413] [2022-12-13 11:46:16,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934342413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:16,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:16,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:46:16,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220891232] [2022-12-13 11:46:16,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:16,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:46:16,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:16,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:46:16,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:46:16,313 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2022-12-13 11:46:16,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 127 transitions, 1207 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 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:46:16,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:16,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2022-12-13 11:46:16,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:19,090 INFO L130 PetriNetUnfolder]: 21775/33495 cut-off events. [2022-12-13 11:46:19,090 INFO L131 PetriNetUnfolder]: For 107913/114349 co-relation queries the response was YES. [2022-12-13 11:46:19,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140181 conditions, 33495 events. 21775/33495 cut-off events. For 107913/114349 co-relation queries the response was YES. Maximal size of possible extension queue 2043. Compared 259472 event pairs, 193 based on Foata normal form. 4029/22032 useless extension candidates. Maximal degree in co-relation 140148. Up to 13015 conditions per place. [2022-12-13 11:46:19,201 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 47 selfloop transitions, 49 changer transitions 100/209 dead transitions. [2022-12-13 11:46:19,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 209 transitions, 2439 flow [2022-12-13 11:46:19,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:46:19,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:46:19,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2022-12-13 11:46:19,202 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6581196581196581 [2022-12-13 11:46:19,202 INFO L175 Difference]: Start difference. First operand has 82 places, 127 transitions, 1207 flow. Second operand 6 states and 154 transitions. [2022-12-13 11:46:19,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 209 transitions, 2439 flow [2022-12-13 11:46:20,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 209 transitions, 2367 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 11:46:20,894 INFO L231 Difference]: Finished difference. Result has 84 places, 86 transitions, 735 flow [2022-12-13 11:46:20,894 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=735, PETRI_PLACES=84, PETRI_TRANSITIONS=86} [2022-12-13 11:46:20,894 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 5 predicate places. [2022-12-13 11:46:20,894 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:20,894 INFO L89 Accepts]: Start accepts. Operand has 84 places, 86 transitions, 735 flow [2022-12-13 11:46:20,895 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:20,895 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:20,896 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 86 transitions, 735 flow [2022-12-13 11:46:20,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 86 transitions, 735 flow [2022-12-13 11:46:21,052 INFO L130 PetriNetUnfolder]: 1755/3318 cut-off events. [2022-12-13 11:46:21,052 INFO L131 PetriNetUnfolder]: For 2732/3957 co-relation queries the response was YES. [2022-12-13 11:46:21,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13194 conditions, 3318 events. 1755/3318 cut-off events. For 2732/3957 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 25109 event pairs, 11 based on Foata normal form. 0/1310 useless extension candidates. Maximal degree in co-relation 13165. Up to 2107 conditions per place. [2022-12-13 11:46:21,076 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 86 transitions, 735 flow [2022-12-13 11:46:21,076 INFO L226 LiptonReduction]: Number of co-enabled transitions 1466 [2022-12-13 11:46:21,481 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:46:21,481 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 587 [2022-12-13 11:46:21,481 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 83 transitions, 729 flow [2022-12-13 11:46:21,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 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:46:21,482 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:21,482 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:46:21,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:46:21,482 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:46:21,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:21,482 INFO L85 PathProgramCache]: Analyzing trace with hash -252891013, now seen corresponding path program 1 times [2022-12-13 11:46:21,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:21,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921932347] [2022-12-13 11:46:21,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:21,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:21,589 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:46:21,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:21,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921932347] [2022-12-13 11:46:21,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921932347] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:21,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:21,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:46:21,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414225889] [2022-12-13 11:46:21,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:21,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:46:21,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:21,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:46:21,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:46:21,592 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2022-12-13 11:46:21,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 83 transitions, 729 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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:46:21,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:21,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2022-12-13 11:46:21,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:22,236 INFO L130 PetriNetUnfolder]: 6015/9168 cut-off events. [2022-12-13 11:46:22,236 INFO L131 PetriNetUnfolder]: For 37718/38454 co-relation queries the response was YES. [2022-12-13 11:46:22,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44660 conditions, 9168 events. 6015/9168 cut-off events. For 37718/38454 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 56919 event pairs, 764 based on Foata normal form. 334/6992 useless extension candidates. Maximal degree in co-relation 44628. Up to 4184 conditions per place. [2022-12-13 11:46:22,285 INFO L137 encePairwiseOnDemand]: 34/37 looper letters, 69 selfloop transitions, 2 changer transitions 30/121 dead transitions. [2022-12-13 11:46:22,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 121 transitions, 1223 flow [2022-12-13 11:46:22,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:46:22,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:46:22,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-12-13 11:46:22,287 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 11:46:22,287 INFO L175 Difference]: Start difference. First operand has 80 places, 83 transitions, 729 flow. Second operand 3 states and 74 transitions. [2022-12-13 11:46:22,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 121 transitions, 1223 flow [2022-12-13 11:46:22,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 121 transitions, 914 flow, removed 64 selfloop flow, removed 11 redundant places. [2022-12-13 11:46:22,678 INFO L231 Difference]: Finished difference. Result has 72 places, 72 transitions, 420 flow [2022-12-13 11:46:22,678 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=72, PETRI_TRANSITIONS=72} [2022-12-13 11:46:22,679 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -7 predicate places. [2022-12-13 11:46:22,679 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:22,679 INFO L89 Accepts]: Start accepts. Operand has 72 places, 72 transitions, 420 flow [2022-12-13 11:46:22,679 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:22,679 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:22,680 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 72 transitions, 420 flow [2022-12-13 11:46:22,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 72 transitions, 420 flow [2022-12-13 11:46:22,742 INFO L130 PetriNetUnfolder]: 860/1518 cut-off events. [2022-12-13 11:46:22,742 INFO L131 PetriNetUnfolder]: For 3244/3802 co-relation queries the response was YES. [2022-12-13 11:46:22,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4782 conditions, 1518 events. 860/1518 cut-off events. For 3244/3802 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 10405 event pairs, 5 based on Foata normal form. 15/524 useless extension candidates. Maximal degree in co-relation 4758. Up to 730 conditions per place. [2022-12-13 11:46:22,750 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 72 transitions, 420 flow [2022-12-13 11:46:22,751 INFO L226 LiptonReduction]: Number of co-enabled transitions 618 [2022-12-13 11:46:23,131 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:46:23,132 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 453 [2022-12-13 11:46:23,132 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 71 transitions, 422 flow [2022-12-13 11:46:23,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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:46:23,132 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:23,132 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:46:23,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 11:46:23,132 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:46:23,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:23,132 INFO L85 PathProgramCache]: Analyzing trace with hash -893636111, now seen corresponding path program 1 times [2022-12-13 11:46:23,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:23,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680726903] [2022-12-13 11:46:23,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:23,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:46:23,157 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:46:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:46:23,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:46:23,228 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:46:23,229 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 11:46:23,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 11:46:23,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 11:46:23,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 11:46:23,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 11:46:23,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 11:46:23,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 11:46:23,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 11:46:23,234 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:23,239 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:46:23,239 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:46:23,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:46:23 BasicIcfg [2022-12-13 11:46:23,314 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:46:23,315 INFO L158 Benchmark]: Toolchain (without parser) took 57530.90ms. Allocated memory was 173.0MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 147.3MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 3.5GB. Max. memory is 8.0GB. [2022-12-13 11:46:23,315 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 173.0MB. Free memory is still 149.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:46:23,315 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.13ms. Allocated memory is still 173.0MB. Free memory was 146.9MB in the beginning and 118.6MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-13 11:46:23,315 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.88ms. Allocated memory is still 173.0MB. Free memory was 118.6MB in the beginning and 115.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 11:46:23,315 INFO L158 Benchmark]: Boogie Preprocessor took 34.69ms. Allocated memory is still 173.0MB. Free memory was 115.4MB in the beginning and 113.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:46:23,315 INFO L158 Benchmark]: RCFGBuilder took 575.66ms. Allocated memory is still 173.0MB. Free memory was 113.3MB in the beginning and 76.1MB in the end (delta: 37.2MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-13 11:46:23,315 INFO L158 Benchmark]: TraceAbstraction took 56417.67ms. Allocated memory was 173.0MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 75.1MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2022-12-13 11:46:23,316 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.10ms. Allocated memory is still 173.0MB. Free memory is still 149.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 434.13ms. Allocated memory is still 173.0MB. Free memory was 146.9MB in the beginning and 118.6MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.88ms. Allocated memory is still 173.0MB. Free memory was 118.6MB in the beginning and 115.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.69ms. Allocated memory is still 173.0MB. Free memory was 115.4MB in the beginning and 113.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 575.66ms. Allocated memory is still 173.0MB. Free memory was 113.3MB in the beginning and 76.1MB in the end (delta: 37.2MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 56417.67ms. Allocated memory was 173.0MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 75.1MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 136 PlacesBefore, 79 PlacesAfterwards, 125 TransitionsBefore, 67 TransitionsAfterwards, 2836 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 52 ConcurrentYvCompositions, 4 ChoiceCompositions, 100 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5511, independent: 5356, independent conditional: 5356, independent unconditional: 0, dependent: 155, dependent conditional: 155, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5511, independent: 5356, independent conditional: 0, independent unconditional: 5356, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5511, independent: 5356, independent conditional: 0, independent unconditional: 5356, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5511, independent: 5356, independent conditional: 0, independent unconditional: 5356, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2707, independent: 2644, independent conditional: 0, independent unconditional: 2644, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2707, independent: 2573, independent conditional: 0, independent unconditional: 2573, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 134, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 221, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5511, independent: 2712, independent conditional: 0, independent unconditional: 2712, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 2707, unknown conditional: 0, unknown unconditional: 2707] , Statistics on independence cache: Total cache size (in pairs): 5152, Positive cache size: 5089, Positive conditional cache size: 0, Positive unconditional cache size: 5089, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, 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, 51 PlacesBefore, 51 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 962 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 483, independent: 439, independent conditional: 439, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 483, independent: 439, independent conditional: 10, independent unconditional: 429, dependent: 44, dependent conditional: 5, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 483, independent: 439, independent conditional: 10, independent unconditional: 429, dependent: 44, dependent conditional: 5, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 483, independent: 439, independent conditional: 10, independent unconditional: 429, dependent: 44, dependent conditional: 5, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 377, independent: 345, independent conditional: 10, independent unconditional: 335, dependent: 32, dependent conditional: 3, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 377, independent: 290, independent conditional: 0, independent unconditional: 290, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 87, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 32, dependent conditional: 3, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 123, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 86, dependent conditional: 15, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 483, independent: 94, independent conditional: 0, independent unconditional: 94, dependent: 12, dependent conditional: 2, dependent unconditional: 10, unknown: 377, unknown conditional: 13, unknown unconditional: 364] , Statistics on independence cache: Total cache size (in pairs): 377, Positive cache size: 345, Positive conditional cache size: 10, Positive unconditional cache size: 335, Negative cache size: 32, Negative conditional cache size: 3, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 902 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 452, independent: 412, independent conditional: 412, 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: 452, independent: 412, independent conditional: 1, independent unconditional: 411, dependent: 40, dependent conditional: 1, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 452, independent: 412, independent conditional: 0, independent unconditional: 412, 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: 452, independent: 412, independent conditional: 0, independent unconditional: 412, 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: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 452, independent: 402, independent conditional: 0, independent unconditional: 402, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 391, Positive cache size: 355, Positive conditional cache size: 10, Positive unconditional cache size: 345, Negative cache size: 36, Negative conditional cache size: 3, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 1074 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 290, independent: 275, independent conditional: 275, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 290, independent: 275, independent conditional: 31, independent unconditional: 244, dependent: 15, dependent conditional: 10, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 290, independent: 275, independent conditional: 0, independent unconditional: 275, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 290, independent: 275, independent conditional: 0, independent unconditional: 275, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 41, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 41, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 290, independent: 236, independent conditional: 0, independent unconditional: 236, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 41, unknown conditional: 0, unknown unconditional: 41] , Statistics on independence cache: Total cache size (in pairs): 432, Positive cache size: 394, Positive conditional cache size: 10, Positive unconditional cache size: 384, Negative cache size: 38, Negative conditional cache size: 3, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 41, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 1376 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 443, independent: 425, independent conditional: 425, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 443, independent: 425, independent conditional: 99, independent unconditional: 326, dependent: 18, dependent conditional: 5, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 443, independent: 425, independent conditional: 17, independent unconditional: 408, 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: 443, independent: 425, independent conditional: 17, independent unconditional: 408, 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: 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: 443, independent: 425, independent conditional: 17, independent unconditional: 408, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 432, Positive cache size: 394, Positive conditional cache size: 10, Positive unconditional cache size: 384, Negative cache size: 38, Negative conditional cache size: 3, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 87, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 63 PlacesBefore, 63 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 1826 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 321, independent: 305, independent conditional: 305, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 321, independent: 305, independent conditional: 116, independent unconditional: 189, dependent: 16, dependent conditional: 5, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 326, independent: 305, independent conditional: 60, independent unconditional: 245, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 326, independent: 305, independent conditional: 60, independent unconditional: 245, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 7, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 326, independent: 299, independent conditional: 60, independent unconditional: 239, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 439, Positive cache size: 400, Positive conditional cache size: 10, Positive unconditional cache size: 390, Negative cache size: 39, Negative conditional cache size: 3, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 66, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 68 PlacesBefore, 68 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 2276 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 642, independent: 622, independent conditional: 622, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 642, independent: 622, independent conditional: 258, independent unconditional: 364, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 642, independent: 622, independent conditional: 120, independent unconditional: 502, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 642, independent: 622, independent conditional: 120, independent unconditional: 502, dependent: 20, dependent conditional: 0, dependent unconditional: 20, 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: 642, independent: 622, independent conditional: 120, independent unconditional: 502, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 439, Positive cache size: 400, Positive conditional cache size: 10, Positive unconditional cache size: 390, Negative cache size: 39, Negative conditional cache size: 3, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 138, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 72 PlacesBefore, 72 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 2854 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 913, independent: 887, independent conditional: 887, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 913, independent: 887, independent conditional: 467, independent unconditional: 420, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 913, independent: 887, independent conditional: 288, independent unconditional: 599, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 913, independent: 887, independent conditional: 288, independent unconditional: 599, dependent: 26, dependent conditional: 0, dependent unconditional: 26, 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: 913, independent: 887, independent conditional: 288, independent unconditional: 599, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 439, Positive cache size: 400, Positive conditional cache size: 10, Positive unconditional cache size: 390, Negative cache size: 39, Negative conditional cache size: 3, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 179, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 77 PlacesBefore, 77 PlacesAfterwards, 119 TransitionsBefore, 119 TransitionsAfterwards, 3840 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 938, independent: 912, independent conditional: 912, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 938, independent: 912, independent conditional: 688, independent unconditional: 224, dependent: 26, dependent conditional: 17, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 938, independent: 912, independent conditional: 317, independent unconditional: 595, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 938, independent: 912, independent conditional: 317, independent unconditional: 595, dependent: 26, dependent conditional: 0, dependent unconditional: 26, 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: 938, independent: 912, independent conditional: 317, independent unconditional: 595, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 439, Positive cache size: 400, Positive conditional cache size: 10, Positive unconditional cache size: 390, Negative cache size: 39, Negative conditional cache size: 3, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 388, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 81 PlacesBefore, 81 PlacesAfterwards, 131 TransitionsBefore, 131 TransitionsAfterwards, 3772 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 29, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 29, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 29, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 29, dependent conditional: 0, dependent unconditional: 29, 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: 29, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 439, Positive cache size: 400, Positive conditional cache size: 10, Positive unconditional cache size: 390, Negative cache size: 39, Negative conditional cache size: 3, Negative unconditional cache size: 36, 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.2s, 82 PlacesBefore, 82 PlacesAfterwards, 127 TransitionsBefore, 127 TransitionsAfterwards, 3588 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 916, independent: 887, independent conditional: 887, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 916, independent: 887, independent conditional: 634, independent unconditional: 253, dependent: 29, dependent conditional: 1, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 919, independent: 887, independent conditional: 336, independent unconditional: 551, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 919, independent: 887, independent conditional: 336, independent unconditional: 551, dependent: 32, dependent conditional: 0, dependent unconditional: 32, 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: 919, independent: 887, independent conditional: 336, independent unconditional: 551, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 439, Positive cache size: 400, Positive conditional cache size: 10, Positive unconditional cache size: 390, Negative cache size: 39, Negative conditional cache size: 3, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 302, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 83 PlacesBefore, 80 PlacesAfterwards, 86 TransitionsBefore, 83 TransitionsAfterwards, 1466 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 672, independent: 644, independent conditional: 644, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 672, independent: 644, independent conditional: 456, independent unconditional: 188, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 672, independent: 644, independent conditional: 364, independent unconditional: 280, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 672, independent: 644, independent conditional: 364, independent unconditional: 280, dependent: 28, dependent conditional: 0, dependent unconditional: 28, 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: 672, independent: 644, independent conditional: 364, independent unconditional: 280, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 504, Positive cache size: 465, Positive conditional cache size: 10, Positive unconditional cache size: 455, Negative cache size: 39, Negative conditional cache size: 3, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 69 PlacesBefore, 68 PlacesAfterwards, 72 TransitionsBefore, 71 TransitionsAfterwards, 618 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 427, independent: 389, independent conditional: 389, 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: 427, independent: 389, independent conditional: 226, independent unconditional: 163, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 427, independent: 389, independent conditional: 198, independent unconditional: 191, 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: 427, independent: 389, independent conditional: 198, independent unconditional: 191, 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: 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: 427, independent: 369, independent conditional: 180, independent unconditional: 189, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 20, unknown conditional: 18, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 569, Positive cache size: 530, Positive conditional cache size: 28, Positive unconditional cache size: 502, Negative cache size: 39, Negative conditional cache size: 3, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, 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_p2_EAX = 0; [L714] 0 int __unbuffered_p2_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L867] 0 pthread_t t213; [L868] FCALL, FORK 0 pthread_create(&t213, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t213, ((void *)0), P0, ((void *)0))=-3, t213={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L869] 0 pthread_t t214; [L870] FCALL, FORK 0 pthread_create(&t214, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t214, ((void *)0), P1, ((void *)0))=-2, t213={5:0}, t214={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 pthread_t t215; [L872] FCALL, FORK 0 pthread_create(&t215, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t215, ((void *)0), P2, ((void *)0))=-1, t213={5:0}, t214={6:0}, t215={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t216; [L874] FCALL, FORK 0 pthread_create(&t216, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t216, ((void *)0), P3, ((void *)0))=0, t213={5:0}, t214={6:0}, t215={7:0}, t216={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 z$w_buff1 = z$w_buff0 [L814] 4 z$w_buff0 = 1 [L815] 4 z$w_buff1_used = z$w_buff0_used [L816] 4 z$w_buff0_used = (_Bool)1 [L817] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L817] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L818] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L819] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L820] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L821] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L822] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L823] 4 z$r_buff0_thd4 = (_Bool)1 [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 z$flush_delayed = weak$$choice2 [L829] 4 z$mem_tmp = z [L830] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L831] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L832] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L833] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L834] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L836] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EAX = z [L838] 4 z = z$flush_delayed ? z$mem_tmp : z [L839] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L842] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 a = 1 [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 2 [L785] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 z$flush_delayed = weak$$choice2 [L791] 3 z$mem_tmp = z [L792] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L793] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L794] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L795] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L798] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 __unbuffered_p2_EBX = z [L800] 3 z = z$flush_delayed ? z$mem_tmp : z [L801] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L845] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L846] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L847] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L848] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L849] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L876] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L878] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L878] RET 0 assume_abort_if_not(main$tmp_guard0) [L880] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L881] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L882] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L883] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L884] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L887] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L889] 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_p2_EAX=2, __unbuffered_p2_EBX=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}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 870]: 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: 868]: 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: 872]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 164 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: 56.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 39.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 398 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 398 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1097 IncrementalHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 26 mSDtfsCounter, 1097 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1340occurred in iteration=9, InterpolantAutomatonStates: 48, 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, 1.5s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 201 ConstructedInterpolants, 0 QuantifiedInterpolants, 639 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:46:23,358 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...