/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/mix023_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:48:45,936 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:48:45,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:48:45,972 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:48:45,973 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:48:45,975 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:48:45,977 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:48:45,981 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:48:45,985 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:48:45,989 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:48:45,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:48:45,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:48:45,991 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:48:45,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:48:45,993 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:48:45,994 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:48:45,995 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:48:45,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:48:45,997 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:48:46,002 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:48:46,003 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:48:46,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:48:46,004 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:48:46,005 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:48:46,010 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:48:46,010 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:48:46,010 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:48:46,011 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:48:46,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:48:46,012 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:48:46,012 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:48:46,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:48:46,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:48:46,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:48:46,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:48:46,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:48:46,019 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:48:46,019 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:48:46,019 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:48:46,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:48:46,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:48:46,024 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:48:46,044 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:48:46,044 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:48:46,045 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:48:46,045 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:48:46,045 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:48:46,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:48:46,045 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:48:46,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:48:46,045 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:48:46,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:48:46,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:48:46,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:48:46,046 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:48:46,046 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:48:46,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:48:46,046 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:48:46,046 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:48:46,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:48:46,046 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:48:46,047 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:48:46,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:48:46,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:48:46,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:48:46,047 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:48:46,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:48:46,047 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:48:46,047 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:48:46,047 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:48:46,047 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:48:46,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:48:46,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:48:46,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:48:46,326 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:48:46,326 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:48:46,327 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.i [2022-12-13 11:48:47,329 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:48:47,631 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:48:47,632 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_tso.i [2022-12-13 11:48:47,644 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59bf013ee/41f4503fc5e94498b8e8c815e139e3b8/FLAG0bfec89ba [2022-12-13 11:48:47,927 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59bf013ee/41f4503fc5e94498b8e8c815e139e3b8 [2022-12-13 11:48:47,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:48:47,930 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:48:47,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:48:47,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:48:47,932 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:48:47,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:48:47" (1/1) ... [2022-12-13 11:48:47,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10712df9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:47, skipping insertion in model container [2022-12-13 11:48:47,934 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:48:47" (1/1) ... [2022-12-13 11:48:47,938 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:48:48,002 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:48:48,123 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/mix023_tso.i[944,957] [2022-12-13 11:48:48,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:48:48,281 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:48:48,288 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/mix023_tso.i[944,957] [2022-12-13 11:48:48,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:48,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:48,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:48:48,385 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:48:48,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:48 WrapperNode [2022-12-13 11:48:48,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:48:48,388 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:48:48,388 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:48:48,388 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:48:48,394 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:48:48" (1/1) ... [2022-12-13 11:48:48,425 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:48:48" (1/1) ... [2022-12-13 11:48:48,471 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 274 [2022-12-13 11:48:48,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:48:48,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:48:48,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:48:48,479 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:48:48,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:48" (1/1) ... [2022-12-13 11:48:48,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:48" (1/1) ... [2022-12-13 11:48:48,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:48" (1/1) ... [2022-12-13 11:48:48,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:48" (1/1) ... [2022-12-13 11:48:48,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:48" (1/1) ... [2022-12-13 11:48:48,525 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:48" (1/1) ... [2022-12-13 11:48:48,527 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:48" (1/1) ... [2022-12-13 11:48:48,528 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:48" (1/1) ... [2022-12-13 11:48:48,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:48:48,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:48:48,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:48:48,533 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:48:48,533 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:48" (1/1) ... [2022-12-13 11:48:48,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:48:48,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:48:48,579 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:48:48,582 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:48:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:48:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:48:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:48:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:48:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:48:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:48:48,610 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:48:48,610 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:48:48,610 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:48:48,610 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:48:48,610 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:48:48,611 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 11:48:48,611 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 11:48:48,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:48:48,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:48:48,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:48:48,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:48:48,612 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:48:48,779 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:48:48,781 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:48:49,138 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:48:49,280 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:48:49,280 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:48:49,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:48:49 BoogieIcfgContainer [2022-12-13 11:48:49,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:48:49,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:48:49,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:48:49,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:48:49,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:48:47" (1/3) ... [2022-12-13 11:48:49,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a2b412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:48:49, skipping insertion in model container [2022-12-13 11:48:49,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:48" (2/3) ... [2022-12-13 11:48:49,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a2b412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:48:49, skipping insertion in model container [2022-12-13 11:48:49,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:48:49" (3/3) ... [2022-12-13 11:48:49,287 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_tso.i [2022-12-13 11:48:49,301 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:48:49,301 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-13 11:48:49,301 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:48:49,368 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:48:49,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 151 transitions, 322 flow [2022-12-13 11:48:49,467 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2022-12-13 11:48:49,467 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:48:49,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 2/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-13 11:48:49,473 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 151 transitions, 322 flow [2022-12-13 11:48:49,481 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 147 transitions, 306 flow [2022-12-13 11:48:49,483 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:49,506 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 147 transitions, 306 flow [2022-12-13 11:48:49,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 147 transitions, 306 flow [2022-12-13 11:48:49,553 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2022-12-13 11:48:49,553 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:48:49,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 2/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-13 11:48:49,558 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 147 transitions, 306 flow [2022-12-13 11:48:49,558 INFO L226 LiptonReduction]: Number of co-enabled transitions 3392 [2022-12-13 11:49:06,383 INFO L241 LiptonReduction]: Total number of compositions: 117 [2022-12-13 11:49:06,400 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:49:06,407 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;@33eaf5d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:49:06,407 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-12-13 11:49:06,410 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-13 11:49:06,410 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:49:06,410 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:49:06,411 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 11:49:06,411 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-13 11:49:06,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:06,414 INFO L85 PathProgramCache]: Analyzing trace with hash 763343967, now seen corresponding path program 1 times [2022-12-13 11:49:06,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:06,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985789789] [2022-12-13 11:49:06,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:06,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:06,783 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:49:06,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:06,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985789789] [2022-12-13 11:49:06,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985789789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:06,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:06,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:49:06,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092979968] [2022-12-13 11:49:06,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:06,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:49:06,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:06,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:49:06,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:49:06,811 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 81 [2022-12-13 11:49:06,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 81 transitions, 174 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:49:06,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:49:06,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 81 [2022-12-13 11:49:06,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:49:23,761 INFO L130 PetriNetUnfolder]: 98183/137923 cut-off events. [2022-12-13 11:49:23,761 INFO L131 PetriNetUnfolder]: For 174/174 co-relation queries the response was YES. [2022-12-13 11:49:24,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266975 conditions, 137923 events. 98183/137923 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 6051. Compared 1036500 event pairs, 33918 based on Foata normal form. 0/86254 useless extension candidates. Maximal degree in co-relation 266963. Up to 111446 conditions per place. [2022-12-13 11:49:24,309 INFO L137 encePairwiseOnDemand]: 75/81 looper letters, 97 selfloop transitions, 2 changer transitions 16/130 dead transitions. [2022-12-13 11:49:24,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 130 transitions, 508 flow [2022-12-13 11:49:24,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:49:24,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:49:24,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2022-12-13 11:49:24,319 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6872427983539094 [2022-12-13 11:49:24,320 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 174 flow. Second operand 3 states and 167 transitions. [2022-12-13 11:49:24,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 130 transitions, 508 flow [2022-12-13 11:49:24,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 130 transitions, 502 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 11:49:24,329 INFO L231 Difference]: Finished difference. Result has 88 places, 69 transitions, 150 flow [2022-12-13 11:49:24,330 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=88, PETRI_TRANSITIONS=69} [2022-12-13 11:49:24,334 INFO L295 CegarLoopForPetriNet]: 93 programPoint places, -5 predicate places. [2022-12-13 11:49:24,335 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:49:24,335 INFO L89 Accepts]: Start accepts. Operand has 88 places, 69 transitions, 150 flow [2022-12-13 11:49:24,340 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:49:24,340 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:49:24,340 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 69 transitions, 150 flow [2022-12-13 11:49:24,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 69 transitions, 150 flow [2022-12-13 11:49:24,365 INFO L130 PetriNetUnfolder]: 0/69 cut-off events. [2022-12-13 11:49:24,366 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:49:24,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 69 events. 0/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 290 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 11:49:24,370 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 69 transitions, 150 flow [2022-12-13 11:49:24,372 INFO L226 LiptonReduction]: Number of co-enabled transitions 2704 [2022-12-13 11:49:24,958 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:49:24,959 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 625 [2022-12-13 11:49:24,960 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 69 transitions, 150 flow [2022-12-13 11:49:24,960 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:49:24,960 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:49:24,960 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:24,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:49:24,960 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-13 11:49:24,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:24,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1236890232, now seen corresponding path program 1 times [2022-12-13 11:49:24,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:24,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011392748] [2022-12-13 11:49:24,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:24,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:25,105 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:49:25,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:25,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011392748] [2022-12-13 11:49:25,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011392748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:25,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:25,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:49:25,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702460513] [2022-12-13 11:49:25,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:25,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:49:25,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:25,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:49:25,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:49:25,107 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 69 [2022-12-13 11:49:25,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 69 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:49:25,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:49:25,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 69 [2022-12-13 11:49:25,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:49:38,485 INFO L130 PetriNetUnfolder]: 82257/116487 cut-off events. [2022-12-13 11:49:38,485 INFO L131 PetriNetUnfolder]: For 4257/4257 co-relation queries the response was YES. [2022-12-13 11:49:38,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228951 conditions, 116487 events. 82257/116487 cut-off events. For 4257/4257 co-relation queries the response was YES. Maximal size of possible extension queue 5027. Compared 883762 event pairs, 10907 based on Foata normal form. 0/76182 useless extension candidates. Maximal degree in co-relation 228941. Up to 92351 conditions per place. [2022-12-13 11:49:39,052 INFO L137 encePairwiseOnDemand]: 66/69 looper letters, 43 selfloop transitions, 2 changer transitions 48/108 dead transitions. [2022-12-13 11:49:39,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 108 transitions, 416 flow [2022-12-13 11:49:39,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:49:39,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:49:39,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2022-12-13 11:49:39,056 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6714975845410628 [2022-12-13 11:49:39,056 INFO L175 Difference]: Start difference. First operand has 80 places, 69 transitions, 150 flow. Second operand 3 states and 139 transitions. [2022-12-13 11:49:39,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 108 transitions, 416 flow [2022-12-13 11:49:39,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 108 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:49:39,063 INFO L231 Difference]: Finished difference. Result has 79 places, 44 transitions, 100 flow [2022-12-13 11:49:39,063 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=79, PETRI_TRANSITIONS=44} [2022-12-13 11:49:39,064 INFO L295 CegarLoopForPetriNet]: 93 programPoint places, -14 predicate places. [2022-12-13 11:49:39,064 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:49:39,064 INFO L89 Accepts]: Start accepts. Operand has 79 places, 44 transitions, 100 flow [2022-12-13 11:49:39,065 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:49:39,065 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:49:39,066 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 44 transitions, 100 flow [2022-12-13 11:49:39,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 44 transitions, 100 flow [2022-12-13 11:49:39,072 INFO L130 PetriNetUnfolder]: 0/44 cut-off events. [2022-12-13 11:49:39,072 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:49:39,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 44 events. 0/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 11:49:39,073 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 44 transitions, 100 flow [2022-12-13 11:49:39,073 INFO L226 LiptonReduction]: Number of co-enabled transitions 1164 [2022-12-13 11:49:39,257 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:49:39,258 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-13 11:49:39,258 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 100 flow [2022-12-13 11:49:39,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:49:39,258 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:49:39,258 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:39,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:49:39,258 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-13 11:49:39,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:39,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1054472822, now seen corresponding path program 1 times [2022-12-13 11:49:39,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:39,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065214457] [2022-12-13 11:49:39,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:39,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:48,448 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:49:48,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:48,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065214457] [2022-12-13 11:49:48,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065214457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:48,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:48,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:49:48,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925745587] [2022-12-13 11:49:48,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:48,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:49:48,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:48,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:49:48,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:49:48,450 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2022-12-13 11:49:48,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:49:48,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:49:48,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2022-12-13 11:49:48,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:49:50,928 INFO L130 PetriNetUnfolder]: 21741/30104 cut-off events. [2022-12-13 11:49:50,929 INFO L131 PetriNetUnfolder]: For 912/912 co-relation queries the response was YES. [2022-12-13 11:49:51,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60540 conditions, 30104 events. 21741/30104 cut-off events. For 912/912 co-relation queries the response was YES. Maximal size of possible extension queue 887. Compared 173888 event pairs, 5431 based on Foata normal form. 504/26212 useless extension candidates. Maximal degree in co-relation 60530. Up to 22779 conditions per place. [2022-12-13 11:49:51,142 INFO L137 encePairwiseOnDemand]: 41/44 looper letters, 53 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2022-12-13 11:49:51,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 66 transitions, 260 flow [2022-12-13 11:49:51,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:49:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:49:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2022-12-13 11:49:51,144 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6742424242424242 [2022-12-13 11:49:51,144 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 100 flow. Second operand 3 states and 89 transitions. [2022-12-13 11:49:51,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 66 transitions, 260 flow [2022-12-13 11:49:51,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 66 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:49:51,151 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 104 flow [2022-12-13 11:49:51,151 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2022-12-13 11:49:51,151 INFO L295 CegarLoopForPetriNet]: 93 programPoint places, -37 predicate places. [2022-12-13 11:49:51,151 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:49:51,151 INFO L89 Accepts]: Start accepts. Operand has 56 places, 44 transitions, 104 flow [2022-12-13 11:49:51,152 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:49:51,152 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:49:51,152 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 44 transitions, 104 flow [2022-12-13 11:49:51,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 44 transitions, 104 flow [2022-12-13 11:49:51,157 INFO L130 PetriNetUnfolder]: 0/44 cut-off events. [2022-12-13 11:49:51,157 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:49:51,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 44 events. 0/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 115 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 11:49:51,158 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 44 transitions, 104 flow [2022-12-13 11:49:51,158 INFO L226 LiptonReduction]: Number of co-enabled transitions 1158 [2022-12-13 11:49:51,205 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:49:51,206 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-13 11:49:51,207 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 104 flow [2022-12-13 11:49:51,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:49:51,207 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:49:51,207 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:51,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:49:51,207 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-13 11:49:51,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:51,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1575828747, now seen corresponding path program 1 times [2022-12-13 11:49:51,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:51,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611066679] [2022-12-13 11:49:51,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:51,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:00,358 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:50:00,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:00,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611066679] [2022-12-13 11:50:00,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611066679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:00,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:00,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:50:00,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057700124] [2022-12-13 11:50:00,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:00,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:50:00,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:00,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:50:00,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:50:00,360 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2022-12-13 11:50:00,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:50:00,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:50:00,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2022-12-13 11:50:00,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:50:02,586 INFO L130 PetriNetUnfolder]: 20493/28496 cut-off events. [2022-12-13 11:50:02,586 INFO L131 PetriNetUnfolder]: For 1856/1856 co-relation queries the response was YES. [2022-12-13 11:50:02,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58969 conditions, 28496 events. 20493/28496 cut-off events. For 1856/1856 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 157076 event pairs, 6213 based on Foata normal form. 360/24652 useless extension candidates. Maximal degree in co-relation 58958. Up to 19681 conditions per place. [2022-12-13 11:50:02,785 INFO L137 encePairwiseOnDemand]: 41/44 looper letters, 49 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2022-12-13 11:50:02,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 245 flow [2022-12-13 11:50:02,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:50:02,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:50:02,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2022-12-13 11:50:02,786 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6439393939393939 [2022-12-13 11:50:02,786 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 104 flow. Second operand 3 states and 85 transitions. [2022-12-13 11:50:02,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 245 flow [2022-12-13 11:50:02,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 239 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:50:02,789 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 108 flow [2022-12-13 11:50:02,789 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2022-12-13 11:50:02,790 INFO L295 CegarLoopForPetriNet]: 93 programPoint places, -36 predicate places. [2022-12-13 11:50:02,790 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:50:02,790 INFO L89 Accepts]: Start accepts. Operand has 57 places, 44 transitions, 108 flow [2022-12-13 11:50:02,791 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:50:02,791 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:50:02,791 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 44 transitions, 108 flow [2022-12-13 11:50:02,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 44 transitions, 108 flow [2022-12-13 11:50:02,796 INFO L130 PetriNetUnfolder]: 0/44 cut-off events. [2022-12-13 11:50:02,796 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 11:50:02,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 44 events. 0/44 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 117 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 11:50:02,797 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 44 transitions, 108 flow [2022-12-13 11:50:02,797 INFO L226 LiptonReduction]: Number of co-enabled transitions 1152 [2022-12-13 11:50:02,798 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:50:02,799 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 11:50:02,799 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 108 flow [2022-12-13 11:50:02,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:50:02,799 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:50:02,800 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:50:02,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:50:02,800 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-13 11:50:02,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:02,800 INFO L85 PathProgramCache]: Analyzing trace with hash 951495110, now seen corresponding path program 1 times [2022-12-13 11:50:02,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:02,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671086632] [2022-12-13 11:50:02,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:02,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:03,078 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:50:03,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:03,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671086632] [2022-12-13 11:50:03,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671086632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:03,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:03,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:50:03,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72906675] [2022-12-13 11:50:03,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:03,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:50:03,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:03,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:50:03,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:50:03,080 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2022-12-13 11:50:03,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 108 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:50:03,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:50:03,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2022-12-13 11:50:03,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:50:05,399 INFO L130 PetriNetUnfolder]: 18405/25044 cut-off events. [2022-12-13 11:50:05,399 INFO L131 PetriNetUnfolder]: For 2772/2772 co-relation queries the response was YES. [2022-12-13 11:50:05,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54390 conditions, 25044 events. 18405/25044 cut-off events. For 2772/2772 co-relation queries the response was YES. Maximal size of possible extension queue 992. Compared 140881 event pairs, 5475 based on Foata normal form. 144/17461 useless extension candidates. Maximal degree in co-relation 54378. Up to 24175 conditions per place. [2022-12-13 11:50:05,531 INFO L137 encePairwiseOnDemand]: 30/44 looper letters, 48 selfloop transitions, 13 changer transitions 0/72 dead transitions. [2022-12-13 11:50:05,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 72 transitions, 296 flow [2022-12-13 11:50:05,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:50:05,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:50:05,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-12-13 11:50:05,533 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7196969696969697 [2022-12-13 11:50:05,533 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 108 flow. Second operand 3 states and 95 transitions. [2022-12-13 11:50:05,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 72 transitions, 296 flow [2022-12-13 11:50:05,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 72 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:50:05,540 INFO L231 Difference]: Finished difference. Result has 58 places, 56 transitions, 193 flow [2022-12-13 11:50:05,540 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=58, PETRI_TRANSITIONS=56} [2022-12-13 11:50:05,541 INFO L295 CegarLoopForPetriNet]: 93 programPoint places, -35 predicate places. [2022-12-13 11:50:05,541 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:50:05,541 INFO L89 Accepts]: Start accepts. Operand has 58 places, 56 transitions, 193 flow [2022-12-13 11:50:05,542 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:50:05,542 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:50:05,542 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 56 transitions, 193 flow [2022-12-13 11:50:05,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 56 transitions, 193 flow [2022-12-13 11:50:05,719 INFO L130 PetriNetUnfolder]: 1269/2318 cut-off events. [2022-12-13 11:50:05,719 INFO L131 PetriNetUnfolder]: For 255/255 co-relation queries the response was YES. [2022-12-13 11:50:05,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4635 conditions, 2318 events. 1269/2318 cut-off events. For 255/255 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 17468 event pairs, 783 based on Foata normal form. 0/1279 useless extension candidates. Maximal degree in co-relation 4625. Up to 1780 conditions per place. [2022-12-13 11:50:05,737 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 56 transitions, 193 flow [2022-12-13 11:50:05,737 INFO L226 LiptonReduction]: Number of co-enabled transitions 1458 [2022-12-13 11:50:05,752 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:50:05,753 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-13 11:50:05,753 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 193 flow [2022-12-13 11:50:05,753 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:50:05,753 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:50:05,753 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:50:05,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:50:05,753 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-13 11:50:05,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:05,753 INFO L85 PathProgramCache]: Analyzing trace with hash 2035671189, now seen corresponding path program 1 times [2022-12-13 11:50:05,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:05,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114740198] [2022-12-13 11:50:05,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:05,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:05,944 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:50:05,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:05,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114740198] [2022-12-13 11:50:05,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114740198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:05,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:05,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:50:05,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547437808] [2022-12-13 11:50:05,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:05,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:50:05,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:05,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:50:05,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:50:05,947 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2022-12-13 11:50:05,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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:50:05,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:50:05,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2022-12-13 11:50:05,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:50:07,622 INFO L130 PetriNetUnfolder]: 12645/18096 cut-off events. [2022-12-13 11:50:07,622 INFO L131 PetriNetUnfolder]: For 2325/2325 co-relation queries the response was YES. [2022-12-13 11:50:07,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49051 conditions, 18096 events. 12645/18096 cut-off events. For 2325/2325 co-relation queries the response was YES. Maximal size of possible extension queue 813. Compared 108648 event pairs, 2046 based on Foata normal form. 504/13069 useless extension candidates. Maximal degree in co-relation 49038. Up to 14851 conditions per place. [2022-12-13 11:50:07,713 INFO L137 encePairwiseOnDemand]: 30/44 looper letters, 62 selfloop transitions, 25 changer transitions 0/98 dead transitions. [2022-12-13 11:50:07,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 98 transitions, 489 flow [2022-12-13 11:50:07,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:50:07,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:50:07,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2022-12-13 11:50:07,714 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.75 [2022-12-13 11:50:07,714 INFO L175 Difference]: Start difference. First operand has 58 places, 56 transitions, 193 flow. Second operand 4 states and 132 transitions. [2022-12-13 11:50:07,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 98 transitions, 489 flow [2022-12-13 11:50:07,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 98 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:50:07,717 INFO L231 Difference]: Finished difference. Result has 61 places, 68 transitions, 328 flow [2022-12-13 11:50:07,717 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=328, PETRI_PLACES=61, PETRI_TRANSITIONS=68} [2022-12-13 11:50:07,718 INFO L295 CegarLoopForPetriNet]: 93 programPoint places, -32 predicate places. [2022-12-13 11:50:07,718 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:50:07,718 INFO L89 Accepts]: Start accepts. Operand has 61 places, 68 transitions, 328 flow [2022-12-13 11:50:07,719 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:50:07,719 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:50:07,719 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 68 transitions, 328 flow [2022-12-13 11:50:07,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 68 transitions, 328 flow [2022-12-13 11:50:07,930 INFO L130 PetriNetUnfolder]: 1161/2174 cut-off events. [2022-12-13 11:50:07,930 INFO L131 PetriNetUnfolder]: For 273/402 co-relation queries the response was YES. [2022-12-13 11:50:07,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6104 conditions, 2174 events. 1161/2174 cut-off events. For 273/402 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 15694 event pairs, 351 based on Foata normal form. 4/1213 useless extension candidates. Maximal degree in co-relation 6092. Up to 1660 conditions per place. [2022-12-13 11:50:07,944 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 68 transitions, 328 flow [2022-12-13 11:50:07,944 INFO L226 LiptonReduction]: Number of co-enabled transitions 1860 [2022-12-13 11:50:08,025 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:50:08,026 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 308 [2022-12-13 11:50:08,026 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 68 transitions, 328 flow [2022-12-13 11:50:08,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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:50:08,026 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:50:08,026 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:50:08,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:50:08,027 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-13 11:50:08,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:08,027 INFO L85 PathProgramCache]: Analyzing trace with hash 760441663, now seen corresponding path program 1 times [2022-12-13 11:50:08,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:08,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418601799] [2022-12-13 11:50:08,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:08,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:08,303 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:50:08,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:08,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418601799] [2022-12-13 11:50:08,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418601799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:08,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:08,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:50:08,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105501400] [2022-12-13 11:50:08,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:08,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:50:08,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:08,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:50:08,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:50:08,308 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2022-12-13 11:50:08,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 68 transitions, 328 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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:50:08,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:50:08,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2022-12-13 11:50:08,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:50:09,297 INFO L130 PetriNetUnfolder]: 7299/11103 cut-off events. [2022-12-13 11:50:09,297 INFO L131 PetriNetUnfolder]: For 2460/2460 co-relation queries the response was YES. [2022-12-13 11:50:09,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36777 conditions, 11103 events. 7299/11103 cut-off events. For 2460/2460 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 68516 event pairs, 696 based on Foata normal form. 657/8281 useless extension candidates. Maximal degree in co-relation 36762. Up to 5512 conditions per place. [2022-12-13 11:50:09,363 INFO L137 encePairwiseOnDemand]: 30/44 looper letters, 74 selfloop transitions, 37 changer transitions 0/122 dead transitions. [2022-12-13 11:50:09,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 122 transitions, 724 flow [2022-12-13 11:50:09,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:50:09,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:50:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2022-12-13 11:50:09,365 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.759090909090909 [2022-12-13 11:50:09,365 INFO L175 Difference]: Start difference. First operand has 61 places, 68 transitions, 328 flow. Second operand 5 states and 167 transitions. [2022-12-13 11:50:09,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 122 transitions, 724 flow [2022-12-13 11:50:09,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 122 transitions, 674 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-13 11:50:09,376 INFO L231 Difference]: Finished difference. Result has 64 places, 80 transitions, 474 flow [2022-12-13 11:50:09,376 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=474, PETRI_PLACES=64, PETRI_TRANSITIONS=80} [2022-12-13 11:50:09,376 INFO L295 CegarLoopForPetriNet]: 93 programPoint places, -29 predicate places. [2022-12-13 11:50:09,376 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:50:09,376 INFO L89 Accepts]: Start accepts. Operand has 64 places, 80 transitions, 474 flow [2022-12-13 11:50:09,377 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:50:09,377 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:50:09,377 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 80 transitions, 474 flow [2022-12-13 11:50:09,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 80 transitions, 474 flow [2022-12-13 11:50:09,525 INFO L130 PetriNetUnfolder]: 837/1688 cut-off events. [2022-12-13 11:50:09,526 INFO L131 PetriNetUnfolder]: For 381/510 co-relation queries the response was YES. [2022-12-13 11:50:09,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6144 conditions, 1688 events. 837/1688 cut-off events. For 381/510 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 11953 event pairs, 81 based on Foata normal form. 4/943 useless extension candidates. Maximal degree in co-relation 6131. Up to 1270 conditions per place. [2022-12-13 11:50:09,537 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 80 transitions, 474 flow [2022-12-13 11:50:09,537 INFO L226 LiptonReduction]: Number of co-enabled transitions 1884 [2022-12-13 11:50:09,544 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:50:09,545 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-13 11:50:09,545 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 80 transitions, 474 flow [2022-12-13 11:50:09,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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:50:09,545 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:50:09,545 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, 1] [2022-12-13 11:50:09,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:50:09,545 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-13 11:50:09,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:09,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1636494915, now seen corresponding path program 1 times [2022-12-13 11:50:09,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:09,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260018569] [2022-12-13 11:50:09,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:09,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:09,790 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:50:09,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:09,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260018569] [2022-12-13 11:50:09,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260018569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:09,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:09,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:50:09,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143261962] [2022-12-13 11:50:09,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:09,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:50:09,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:09,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:50:09,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:50:09,791 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2022-12-13 11:50:09,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 80 transitions, 474 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:50:09,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:50:09,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2022-12-13 11:50:09,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:50:11,137 INFO L130 PetriNetUnfolder]: 9552/15497 cut-off events. [2022-12-13 11:50:11,137 INFO L131 PetriNetUnfolder]: For 14503/16816 co-relation queries the response was YES. [2022-12-13 11:50:11,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56436 conditions, 15497 events. 9552/15497 cut-off events. For 14503/16816 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 113970 event pairs, 778 based on Foata normal form. 1226/13769 useless extension candidates. Maximal degree in co-relation 56420. Up to 7981 conditions per place. [2022-12-13 11:50:11,243 INFO L137 encePairwiseOnDemand]: 41/44 looper letters, 115 selfloop transitions, 2 changer transitions 14/157 dead transitions. [2022-12-13 11:50:11,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 157 transitions, 1215 flow [2022-12-13 11:50:11,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:50:11,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:50:11,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2022-12-13 11:50:11,245 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2022-12-13 11:50:11,245 INFO L175 Difference]: Start difference. First operand has 64 places, 80 transitions, 474 flow. Second operand 4 states and 128 transitions. [2022-12-13 11:50:11,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 157 transitions, 1215 flow [2022-12-13 11:50:11,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 157 transitions, 1005 flow, removed 52 selfloop flow, removed 3 redundant places. [2022-12-13 11:50:11,439 INFO L231 Difference]: Finished difference. Result has 66 places, 81 transitions, 389 flow [2022-12-13 11:50:11,439 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=389, PETRI_PLACES=66, PETRI_TRANSITIONS=81} [2022-12-13 11:50:11,439 INFO L295 CegarLoopForPetriNet]: 93 programPoint places, -27 predicate places. [2022-12-13 11:50:11,440 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:50:11,440 INFO L89 Accepts]: Start accepts. Operand has 66 places, 81 transitions, 389 flow [2022-12-13 11:50:11,440 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:50:11,440 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:50:11,441 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 81 transitions, 389 flow [2022-12-13 11:50:11,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 81 transitions, 389 flow [2022-12-13 11:50:11,626 INFO L130 PetriNetUnfolder]: 1665/3139 cut-off events. [2022-12-13 11:50:11,626 INFO L131 PetriNetUnfolder]: For 1893/2019 co-relation queries the response was YES. [2022-12-13 11:50:11,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9968 conditions, 3139 events. 1665/3139 cut-off events. For 1893/2019 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 25057 event pairs, 162 based on Foata normal form. 6/1592 useless extension candidates. Maximal degree in co-relation 9954. Up to 2404 conditions per place. [2022-12-13 11:50:11,645 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 81 transitions, 389 flow [2022-12-13 11:50:11,645 INFO L226 LiptonReduction]: Number of co-enabled transitions 1924 [2022-12-13 11:50:11,669 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:50:11,670 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 230 [2022-12-13 11:50:11,670 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 81 transitions, 389 flow [2022-12-13 11:50:11,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:50:11,670 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:50:11,670 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, 1] [2022-12-13 11:50:11,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:50:11,670 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-13 11:50:11,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:11,671 INFO L85 PathProgramCache]: Analyzing trace with hash 665384498, now seen corresponding path program 1 times [2022-12-13 11:50:11,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:11,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083931160] [2022-12-13 11:50:11,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:11,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:13,090 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:50:13,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:13,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083931160] [2022-12-13 11:50:13,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083931160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:13,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:13,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:50:13,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891013172] [2022-12-13 11:50:13,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:13,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 11:50:13,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:13,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 11:50:13,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 11:50:13,092 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2022-12-13 11:50:13,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 81 transitions, 389 flow. Second operand has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 states have internal predecessors, (146), 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:50:13,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:50:13,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2022-12-13 11:50:13,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:50:16,923 INFO L130 PetriNetUnfolder]: 25397/40646 cut-off events. [2022-12-13 11:50:16,923 INFO L131 PetriNetUnfolder]: For 35458/39150 co-relation queries the response was YES. [2022-12-13 11:50:17,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130865 conditions, 40646 events. 25397/40646 cut-off events. For 35458/39150 co-relation queries the response was YES. Maximal size of possible extension queue 2124. Compared 332154 event pairs, 2107 based on Foata normal form. 2435/35050 useless extension candidates. Maximal degree in co-relation 130848. Up to 15082 conditions per place. [2022-12-13 11:50:17,174 INFO L137 encePairwiseOnDemand]: 35/44 looper letters, 211 selfloop transitions, 19 changer transitions 14/271 dead transitions. [2022-12-13 11:50:17,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 271 transitions, 1724 flow [2022-12-13 11:50:17,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 11:50:17,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 11:50:17,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 262 transitions. [2022-12-13 11:50:17,176 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7443181818181818 [2022-12-13 11:50:17,176 INFO L175 Difference]: Start difference. First operand has 66 places, 81 transitions, 389 flow. Second operand 8 states and 262 transitions. [2022-12-13 11:50:17,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 271 transitions, 1724 flow [2022-12-13 11:50:18,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 271 transitions, 1717 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:50:18,498 INFO L231 Difference]: Finished difference. Result has 77 places, 100 transitions, 526 flow [2022-12-13 11:50:18,498 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=526, PETRI_PLACES=77, PETRI_TRANSITIONS=100} [2022-12-13 11:50:18,498 INFO L295 CegarLoopForPetriNet]: 93 programPoint places, -16 predicate places. [2022-12-13 11:50:18,498 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:50:18,498 INFO L89 Accepts]: Start accepts. Operand has 77 places, 100 transitions, 526 flow [2022-12-13 11:50:18,499 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:50:18,499 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:50:18,500 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 100 transitions, 526 flow [2022-12-13 11:50:18,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 100 transitions, 526 flow [2022-12-13 11:50:19,684 INFO L130 PetriNetUnfolder]: 8229/15577 cut-off events. [2022-12-13 11:50:19,684 INFO L131 PetriNetUnfolder]: For 13365/16566 co-relation queries the response was YES. [2022-12-13 11:50:19,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48419 conditions, 15577 events. 8229/15577 cut-off events. For 13365/16566 co-relation queries the response was YES. Maximal size of possible extension queue 2079. Compared 154587 event pairs, 645 based on Foata normal form. 64/7473 useless extension candidates. Maximal degree in co-relation 48399. Up to 10828 conditions per place. [2022-12-13 11:50:19,827 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 100 transitions, 526 flow [2022-12-13 11:50:19,828 INFO L226 LiptonReduction]: Number of co-enabled transitions 2788 [2022-12-13 11:50:20,236 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] $Ultimate##0-->L801: Formula: (and (= (ite (not (and (not (= 0 (mod v_~x$w_buff1_used~0_230 256))) (not (= (mod v_~x$w_buff0_used~0_253 256) 0)))) 1 0) |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_9|) (= v_~x$r_buff1_thd2~0_71 v_~x$r_buff0_thd2~0_93) (= v_~x$r_buff1_thd1~0_33 v_~x$r_buff0_thd1~0_37) (= v_~x$r_buff1_thd3~0_37 v_~x$r_buff0_thd3~0_37) (= |v_P1Thread1of1ForFork3_#in~arg#1.offset_7| |v_P1Thread1of1ForFork3_~arg#1.offset_7|) (= v_~x$r_buff1_thd0~0_91 v_~x$r_buff0_thd0~0_93) (= v_~x$w_buff0_used~0_254 v_~x$w_buff1_used~0_230) (not (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_9| 0)) (= v_~x$r_buff1_thd4~0_51 v_~x$r_buff0_thd4~0_51) (= v_~x$r_buff0_thd2~0_92 1) (= v_~x$w_buff0~0_130 v_~x$w_buff1~0_112) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_9|) (= |v_P1Thread1of1ForFork3_~arg#1.base_7| |v_P1Thread1of1ForFork3_#in~arg#1.base_7|) (= 2 v_~x$w_buff0~0_129) (= v_~x$w_buff0_used~0_253 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_130, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_93, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_37, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_51, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_37, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_93, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_254} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_129, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_93, P1Thread1of1ForFork3_~arg#1.base=|v_P1Thread1of1ForFork3_~arg#1.base_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_37, ~x$w_buff1~0=v_~x$w_buff1~0_112, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_71, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_230, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_33, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_51, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_37, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_92, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_91, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_9|, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_253, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_9|, P1Thread1of1ForFork3_~arg#1.offset=|v_P1Thread1of1ForFork3_~arg#1.offset_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork3_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork3_~arg#1.offset] and [579] L771-->L774: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] [2022-12-13 11:50:20,561 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] $Ultimate##0-->L801: Formula: (and (= (ite (not (and (not (= 0 (mod v_~x$w_buff1_used~0_230 256))) (not (= (mod v_~x$w_buff0_used~0_253 256) 0)))) 1 0) |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_9|) (= v_~x$r_buff1_thd2~0_71 v_~x$r_buff0_thd2~0_93) (= v_~x$r_buff1_thd1~0_33 v_~x$r_buff0_thd1~0_37) (= v_~x$r_buff1_thd3~0_37 v_~x$r_buff0_thd3~0_37) (= |v_P1Thread1of1ForFork3_#in~arg#1.offset_7| |v_P1Thread1of1ForFork3_~arg#1.offset_7|) (= v_~x$r_buff1_thd0~0_91 v_~x$r_buff0_thd0~0_93) (= v_~x$w_buff0_used~0_254 v_~x$w_buff1_used~0_230) (not (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_9| 0)) (= v_~x$r_buff1_thd4~0_51 v_~x$r_buff0_thd4~0_51) (= v_~x$r_buff0_thd2~0_92 1) (= v_~x$w_buff0~0_130 v_~x$w_buff1~0_112) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_9|) (= |v_P1Thread1of1ForFork3_~arg#1.base_7| |v_P1Thread1of1ForFork3_#in~arg#1.base_7|) (= 2 v_~x$w_buff0~0_129) (= v_~x$w_buff0_used~0_253 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_130, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_93, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_37, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_51, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_37, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_93, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_254} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_129, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_93, P1Thread1of1ForFork3_~arg#1.base=|v_P1Thread1of1ForFork3_~arg#1.base_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_37, ~x$w_buff1~0=v_~x$w_buff1~0_112, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_71, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_230, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_33, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_51, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_37, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_92, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_91, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_9|, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_253, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_9|, P1Thread1of1ForFork3_~arg#1.offset=|v_P1Thread1of1ForFork3_~arg#1.offset_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork3_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork3_~arg#1.offset] and [596] L840-->L852: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff1_thd3~0_26 256) 0))) (.cse8 (not (= (mod v_~z$w_buff0_used~0_153 256) 0))) (.cse10 (not (= (mod v_~z$r_buff0_thd3~0_38 256) 0))) (.cse9 (not (= (mod v_~z$r_buff1_thd3~0_34 256) 0))) (.cse6 (not (= (mod v_~x$w_buff0_used~0_207 256) 0))) (.cse11 (not (= (mod v_~x$r_buff0_thd3~0_28 256) 0)))) (let ((.cse1 (and .cse6 .cse11)) (.cse4 (and .cse9 (not (= (mod v_~z$w_buff1_used~0_145 256) 0)))) (.cse7 (and .cse8 .cse10)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_208 256) 0)) .cse11)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_197 256) 0)) .cse5)) (.cse3 (and .cse10 (not (= (mod v_~z$w_buff0_used~0_154 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_208) v_~x$w_buff0_used~0_207) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_197) v_~x$w_buff1_used~0_196) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_28) v_~x$r_buff0_thd3~0_27) (= v_~z~0_147 (ite .cse3 v_~z$w_buff0~0_87 (ite .cse4 v_~z$w_buff1~0_78 v_~z~0_148))) (= v_~x$r_buff1_thd3~0_25 (ite (or (and .cse5 (not (= (mod v_~x$w_buff1_used~0_196 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_27 256) 0)) .cse6)) 0 v_~x$r_buff1_thd3~0_26)) (= (ite .cse7 0 v_~z$r_buff0_thd3~0_38) v_~z$r_buff0_thd3~0_37) (= v_~z$w_buff1_used~0_144 (ite (or .cse4 .cse7) 0 v_~z$w_buff1_used~0_145)) (= (ite .cse0 v_~x$w_buff0~0_93 (ite .cse2 v_~x$w_buff1~0_88 v_~x~0_144)) v_~x~0_143) (= (ite (or (and .cse8 (not (= (mod v_~z$r_buff0_thd3~0_37 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_144 256) 0)) .cse9)) 0 v_~z$r_buff1_thd3~0_34) v_~z$r_buff1_thd3~0_33) (= v_~z$w_buff0_used~0_153 (ite .cse3 0 v_~z$w_buff0_used~0_154))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_93, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_154, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~x$w_buff1~0=v_~x$w_buff1~0_88, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_145, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_197, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_28, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_208, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_38, ~z~0=v_~z~0_148, ~x~0=v_~x~0_144} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_93, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_153, ~z$w_buff0~0=v_~z$w_buff0~0_87, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_88, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_144, ~z$w_buff1~0=v_~z$w_buff1~0_78, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_196, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_27, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_207, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_37, ~z~0=v_~z~0_147, ~x~0=v_~x~0_143} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~z$r_buff0_thd3~0, ~x$r_buff0_thd3~0, ~z~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:50:20,872 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] $Ultimate##0-->L801: Formula: (and (= (ite (not (and (not (= 0 (mod v_~x$w_buff1_used~0_230 256))) (not (= (mod v_~x$w_buff0_used~0_253 256) 0)))) 1 0) |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_9|) (= v_~x$r_buff1_thd2~0_71 v_~x$r_buff0_thd2~0_93) (= v_~x$r_buff1_thd1~0_33 v_~x$r_buff0_thd1~0_37) (= v_~x$r_buff1_thd3~0_37 v_~x$r_buff0_thd3~0_37) (= |v_P1Thread1of1ForFork3_#in~arg#1.offset_7| |v_P1Thread1of1ForFork3_~arg#1.offset_7|) (= v_~x$r_buff1_thd0~0_91 v_~x$r_buff0_thd0~0_93) (= v_~x$w_buff0_used~0_254 v_~x$w_buff1_used~0_230) (not (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_9| 0)) (= v_~x$r_buff1_thd4~0_51 v_~x$r_buff0_thd4~0_51) (= v_~x$r_buff0_thd2~0_92 1) (= v_~x$w_buff0~0_130 v_~x$w_buff1~0_112) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_9|) (= |v_P1Thread1of1ForFork3_~arg#1.base_7| |v_P1Thread1of1ForFork3_#in~arg#1.base_7|) (= 2 v_~x$w_buff0~0_129) (= v_~x$w_buff0_used~0_253 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_130, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_93, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_37, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_51, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_37, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_93, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_254} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_129, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_93, P1Thread1of1ForFork3_~arg#1.base=|v_P1Thread1of1ForFork3_~arg#1.base_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_37, ~x$w_buff1~0=v_~x$w_buff1~0_112, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_71, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_230, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_33, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_51, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_37, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_92, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_91, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_9|, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_253, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_9|, P1Thread1of1ForFork3_~arg#1.offset=|v_P1Thread1of1ForFork3_~arg#1.offset_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork3_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork3_~arg#1.offset] and [605] L891-->L903: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_36 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_203 256) 0))) (.cse11 (not (= (mod v_~x$r_buff0_thd4~0_36 256) 0))) (.cse5 (not (= (mod v_~z$r_buff1_thd4~0_68 256) 0))) (.cse6 (not (= (mod v_~z$w_buff0_used~0_149 256) 0))) (.cse10 (not (= (mod v_~z$r_buff0_thd4~0_77 256) 0)))) (let ((.cse1 (and .cse6 .cse10)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff1_used~0_141 256) 0)))) (.cse7 (and .cse4 .cse11)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_204 256) 0)) .cse11)) (.cse8 (and (not (= (mod v_~x$w_buff1_used~0_193 256) 0)) .cse3)) (.cse9 (and (not (= (mod v_~z$w_buff0_used~0_150 256) 0)) .cse10))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_204) v_~x$w_buff0_used~0_203) (= v_~z$r_buff0_thd4~0_76 (ite .cse1 0 v_~z$r_buff0_thd4~0_77)) (= (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_141) v_~z$w_buff1_used~0_140) (= v_~x$r_buff1_thd4~0_35 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_192 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_35 256) 0)))) 0 v_~x$r_buff1_thd4~0_36)) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_140 256) 0)) .cse5) (and .cse6 (not (= (mod v_~z$r_buff0_thd4~0_76 256) 0)))) 0 v_~z$r_buff1_thd4~0_68) v_~z$r_buff1_thd4~0_67) (= (ite (or .cse7 .cse8) 0 v_~x$w_buff1_used~0_193) v_~x$w_buff1_used~0_192) (= (ite .cse9 v_~z$w_buff0~0_85 (ite .cse2 v_~z$w_buff1~0_76 v_~z~0_144)) v_~z~0_143) (= v_~x$r_buff0_thd4~0_35 (ite .cse7 0 v_~x$r_buff0_thd4~0_36)) (= (ite .cse0 v_~x$w_buff0~0_91 (ite .cse8 v_~x$w_buff1~0_86 v_~x~0_140)) v_~x~0_139) (= v_~z$w_buff0_used~0_149 (ite .cse9 0 v_~z$w_buff0_used~0_150))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_68, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_150, ~z$w_buff0~0=v_~z$w_buff0~0_85, ~x$w_buff1~0=v_~x$w_buff1~0_86, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_141, ~z$w_buff1~0=v_~z$w_buff1~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_193, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_36, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_36, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_204, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_77, ~z~0=v_~z~0_144, ~x~0=v_~x~0_140} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_91, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_67, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_149, ~z$w_buff0~0=v_~z$w_buff0~0_85, ~x$w_buff1~0=v_~x$w_buff1~0_86, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_140, ~z$w_buff1~0=v_~z$w_buff1~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_192, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_35, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_35, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_76, ~z~0=v_~z~0_143, ~x~0=v_~x~0_139} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ~z$r_buff0_thd4~0, ~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~z~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] [2022-12-13 11:50:21,345 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:50:21,346 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2848 [2022-12-13 11:50:21,346 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 99 transitions, 534 flow [2022-12-13 11:50:21,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 states have internal predecessors, (146), 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:50:21,346 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:50:21,347 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, 1] [2022-12-13 11:50:21,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:50:21,347 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-13 11:50:21,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:21,347 INFO L85 PathProgramCache]: Analyzing trace with hash 93264726, now seen corresponding path program 2 times [2022-12-13 11:50:21,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:21,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248298103] [2022-12-13 11:50:21,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:21,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:21,595 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:50:21,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:21,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248298103] [2022-12-13 11:50:21,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248298103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:21,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:21,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:50:21,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558412269] [2022-12-13 11:50:21,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:21,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:50:21,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:21,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:50:21,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:50:21,597 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2022-12-13 11:50:21,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 99 transitions, 534 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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:50:21,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:50:21,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2022-12-13 11:50:21,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:50:24,262 INFO L130 PetriNetUnfolder]: 20638/30935 cut-off events. [2022-12-13 11:50:24,262 INFO L131 PetriNetUnfolder]: For 35206/35602 co-relation queries the response was YES. [2022-12-13 11:50:24,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113215 conditions, 30935 events. 20638/30935 cut-off events. For 35206/35602 co-relation queries the response was YES. Maximal size of possible extension queue 1410. Compared 218231 event pairs, 730 based on Foata normal form. 2234/21186 useless extension candidates. Maximal degree in co-relation 113192. Up to 11178 conditions per place. [2022-12-13 11:50:24,438 INFO L137 encePairwiseOnDemand]: 34/48 looper letters, 79 selfloop transitions, 49 changer transitions 16/158 dead transitions. [2022-12-13 11:50:24,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 158 transitions, 1084 flow [2022-12-13 11:50:24,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:50:24,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:50:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2022-12-13 11:50:24,439 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6319444444444444 [2022-12-13 11:50:24,439 INFO L175 Difference]: Start difference. First operand has 76 places, 99 transitions, 534 flow. Second operand 6 states and 182 transitions. [2022-12-13 11:50:24,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 158 transitions, 1084 flow [2022-12-13 11:50:26,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 158 transitions, 1036 flow, removed 15 selfloop flow, removed 3 redundant places. [2022-12-13 11:50:26,674 INFO L231 Difference]: Finished difference. Result has 79 places, 96 transitions, 620 flow [2022-12-13 11:50:26,675 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=620, PETRI_PLACES=79, PETRI_TRANSITIONS=96} [2022-12-13 11:50:26,675 INFO L295 CegarLoopForPetriNet]: 93 programPoint places, -14 predicate places. [2022-12-13 11:50:26,675 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:50:26,675 INFO L89 Accepts]: Start accepts. Operand has 79 places, 96 transitions, 620 flow [2022-12-13 11:50:26,676 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:50:26,676 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:50:26,676 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 96 transitions, 620 flow [2022-12-13 11:50:26,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 96 transitions, 620 flow [2022-12-13 11:50:27,097 INFO L130 PetriNetUnfolder]: 2601/4632 cut-off events. [2022-12-13 11:50:27,097 INFO L131 PetriNetUnfolder]: For 2525/3538 co-relation queries the response was YES. [2022-12-13 11:50:27,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17344 conditions, 4632 events. 2601/4632 cut-off events. For 2525/3538 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 34476 event pairs, 14 based on Foata normal form. 1/1791 useless extension candidates. Maximal degree in co-relation 17324. Up to 2782 conditions per place. [2022-12-13 11:50:27,128 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 96 transitions, 620 flow [2022-12-13 11:50:27,128 INFO L226 LiptonReduction]: Number of co-enabled transitions 2290 [2022-12-13 11:50:27,211 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [672] $Ultimate##0-->L771: Formula: (and (= v_~a~0_14 1) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{~a~0=v_~a~0_14, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_~arg.base] and [789] $Ultimate##0-->L774: Formula: (and (= v_~x$w_buff0_used~0_794 v_~x$w_buff1_used~0_757) (= v_~x~0_696 1) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_29| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_793 256) 0)) (not (= (mod v_~x$w_buff1_used~0_757 256) 0)))) 1 0)) (= v_~x$r_buff0_thd0~0_376 v_~x$r_buff1_thd0~0_380) (= v_~x$w_buff0_used~0_793 1) (= v_~x$r_buff0_thd3~0_129 v_~x$r_buff1_thd3~0_133) (= v_~x$r_buff0_thd4~0_235 v_~x$r_buff1_thd4~0_238) (not (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_29| 0)) (= |v_P1Thread1of1ForFork3_#in~arg#1.base_27| |v_P1Thread1of1ForFork3_~arg#1.base_27|) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_29| |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_29|) (= v_~x$r_buff0_thd2~0_211 v_~x$r_buff1_thd2~0_175) (= v_~x$r_buff0_thd1~0_111 v_~x$r_buff1_thd1~0_103) (= |v_P1Thread1of1ForFork3_~arg#1.offset_27| |v_P1Thread1of1ForFork3_#in~arg#1.offset_27|) (= v_~x$w_buff0~0_503 v_~x$w_buff1~0_476) (= v_~x$r_buff0_thd2~0_210 1) (= 2 v_~x$w_buff0~0_502)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_503, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_376, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_111, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_235, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_129, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_211, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_27|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_27|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_794} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_502, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_376, P1Thread1of1ForFork3_~arg#1.base=|v_P1Thread1of1ForFork3_~arg#1.base_27|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_111, ~x$w_buff1~0=v_~x$w_buff1~0_476, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_133, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_175, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_757, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_103, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_235, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_129, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_210, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_380, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_29|, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_27|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_238, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_793, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_29|, ~x~0=v_~x~0_696, P1Thread1of1ForFork3_~arg#1.offset=|v_P1Thread1of1ForFork3_~arg#1.offset_27|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_27|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork3_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, ~x~0, P1Thread1of1ForFork3_~arg#1.offset] [2022-12-13 11:50:27,524 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L888-->L891: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~a~0=v_~a~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0] and [792] $Ultimate##0-->L903: Formula: (let ((.cse7 (not (= 0 (mod v_~z$w_buff0_used~0_687 256)))) (.cse10 (not (= (mod v_~z$r_buff0_thd4~0_339 256) 0))) (.cse9 (= (mod v_~x$w_buff0_used~0_811 256) 0)) (.cse4 (not (= (mod v_~x$r_buff0_thd4~0_242 256) 0))) (.cse5 (not (= (mod v_~x$w_buff0_used~0_809 256) 0))) (.cse8 (not (= (mod v_~z$r_buff1_thd4~0_308 256) 0)))) (let ((.cse1 (and .cse8 (not (= (mod v_~z$w_buff1_used~0_651 256) 0)))) (.cse2 (and .cse4 .cse5)) (.cse6 (and .cse4 (not .cse9))) (.cse3 (and .cse7 .cse10)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_688 256) 0)) .cse10))) (and (= v_~x$r_buff0_thd3~0_137 v_~x$r_buff1_thd3~0_141) (= |v_P1Thread1of1ForFork3_~arg#1.offset_33| |v_P1Thread1of1ForFork3_#in~arg#1.offset_33|) (= v_~z~0_659 (ite .cse0 v_~z$w_buff0~0_474 (ite .cse1 v_~z$w_buff1~0_443 v_~z~0_660))) (= v_~x$r_buff0_thd4~0_241 (ite .cse2 0 v_~x$r_buff0_thd4~0_242)) (= |v_P1Thread1of1ForFork3_#in~arg#1.base_33| |v_P1Thread1of1ForFork3_~arg#1.base_33|) (= v_~z$w_buff1_used~0_650 (ite (or .cse1 .cse3) 0 v_~z$w_buff1_used~0_651)) (= v_~x$r_buff1_thd4~0_244 (ite (or (and .cse4 (not (= (mod v_~x$w_buff1_used~0_767 256) 0))) (and .cse5 (not (= 0 (mod v_~x$r_buff0_thd4~0_241 256))))) 0 v_~x$r_buff0_thd4~0_242)) (= v_~x$r_buff0_thd0~0_382 v_~x$r_buff1_thd0~0_386) (= v_~x$r_buff0_thd2~0_224 1) (= (ite .cse4 v_~x$w_buff0~0_516 (ite .cse6 v_~x$w_buff1~0_484 v_~x~0_707)) v_~x~0_706) (= v_~x$r_buff0_thd2~0_225 v_~x$r_buff1_thd2~0_183) (= v_~z$r_buff1_thd4~0_307 (ite (or (and .cse7 (not (= (mod v_~z$r_buff0_thd4~0_338 256) 0))) (and .cse8 (not (= (mod v_~z$w_buff1_used~0_650 256) 0)))) 0 v_~z$r_buff1_thd4~0_308)) (= v_~x$w_buff1_used~0_767 (ite (or .cse2 .cse6) 0 v_~x$w_buff0_used~0_811)) (= 2 v_~x$w_buff0~0_516) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_35| (ite .cse9 1 0)) (= (ite .cse3 0 v_~z$r_buff0_thd4~0_339) v_~z$r_buff0_thd4~0_338) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_35| |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_35|) (not (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_35| 0)) (= (ite .cse0 0 v_~z$w_buff0_used~0_688) v_~z$w_buff0_used~0_687) (= (ite .cse4 0 1) v_~x$w_buff0_used~0_809) (= v_~x$r_buff0_thd1~0_117 v_~x$r_buff1_thd1~0_109) (= v_~x$w_buff0~0_517 v_~x$w_buff1~0_484)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_517, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_382, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_117, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_308, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_688, ~z$w_buff0~0=v_~z$w_buff0~0_474, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_651, ~z$w_buff1~0=v_~z$w_buff1~0_443, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_242, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_137, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_225, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_33|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_811, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_339, ~z~0=v_~z~0_660, ~x~0=v_~x~0_707, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_33|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_516, P1Thread1of1ForFork3_~arg#1.base=|v_P1Thread1of1ForFork3_~arg#1.base_33|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_117, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_307, ~z$w_buff1~0=v_~z$w_buff1~0_443, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_141, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_109, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_137, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_33|, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_35|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_338, P1Thread1of1ForFork3_~arg#1.offset=|v_P1Thread1of1ForFork3_~arg#1.offset_33|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_33|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_382, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_687, ~z$w_buff0~0=v_~z$w_buff0~0_474, ~x$w_buff1~0=v_~x$w_buff1~0_484, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_650, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_767, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_183, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_241, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_224, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_386, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_35|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_244, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_809, ~z~0=v_~z~0_659, ~x~0=v_~x~0_706} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork3_~arg#1.base, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~x$w_buff1~0, ~z$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd4~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, ~z$r_buff0_thd4~0, ~z~0, P1Thread1of1ForFork3_~arg#1.offset, ~x~0] [2022-12-13 11:50:29,933 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 11:50:29,934 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3259 [2022-12-13 11:50:29,934 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 93 transitions, 628 flow [2022-12-13 11:50:29,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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:50:29,934 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:50:29,934 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, 1] [2022-12-13 11:50:29,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:50:29,934 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-13 11:50:29,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:29,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1614706736, now seen corresponding path program 1 times [2022-12-13 11:50:29,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:29,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871286233] [2022-12-13 11:50:29,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:29,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:30,143 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:50:30,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:30,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871286233] [2022-12-13 11:50:30,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871286233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:30,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:30,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:50:30,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633140685] [2022-12-13 11:50:30,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:30,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:50:30,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:30,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:50:30,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:50:30,144 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2022-12-13 11:50:30,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 93 transitions, 628 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:50:30,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:50:30,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2022-12-13 11:50:30,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:50:32,125 INFO L130 PetriNetUnfolder]: 15578/24122 cut-off events. [2022-12-13 11:50:32,125 INFO L131 PetriNetUnfolder]: For 41957/44267 co-relation queries the response was YES. [2022-12-13 11:50:32,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94989 conditions, 24122 events. 15578/24122 cut-off events. For 41957/44267 co-relation queries the response was YES. Maximal size of possible extension queue 1287. Compared 176069 event pairs, 901 based on Foata normal form. 1160/19854 useless extension candidates. Maximal degree in co-relation 94966. Up to 10601 conditions per place. [2022-12-13 11:50:32,286 INFO L137 encePairwiseOnDemand]: 46/49 looper letters, 122 selfloop transitions, 2 changer transitions 30/178 dead transitions. [2022-12-13 11:50:32,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 178 transitions, 1520 flow [2022-12-13 11:50:32,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:50:32,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:50:32,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2022-12-13 11:50:32,288 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6530612244897959 [2022-12-13 11:50:32,288 INFO L175 Difference]: Start difference. First operand has 74 places, 93 transitions, 628 flow. Second operand 4 states and 128 transitions. [2022-12-13 11:50:32,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 178 transitions, 1520 flow [2022-12-13 11:50:34,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 178 transitions, 1246 flow, removed 61 selfloop flow, removed 5 redundant places. [2022-12-13 11:50:34,990 INFO L231 Difference]: Finished difference. Result has 74 places, 94 transitions, 493 flow [2022-12-13 11:50:34,990 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=493, PETRI_PLACES=74, PETRI_TRANSITIONS=94} [2022-12-13 11:50:34,991 INFO L295 CegarLoopForPetriNet]: 93 programPoint places, -19 predicate places. [2022-12-13 11:50:34,991 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:50:34,991 INFO L89 Accepts]: Start accepts. Operand has 74 places, 94 transitions, 493 flow [2022-12-13 11:50:34,991 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:50:34,992 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:50:34,992 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 94 transitions, 493 flow [2022-12-13 11:50:34,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 94 transitions, 493 flow [2022-12-13 11:50:35,312 INFO L130 PetriNetUnfolder]: 3915/6583 cut-off events. [2022-12-13 11:50:35,312 INFO L131 PetriNetUnfolder]: For 4312/4965 co-relation queries the response was YES. [2022-12-13 11:50:35,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19010 conditions, 6583 events. 3915/6583 cut-off events. For 4312/4965 co-relation queries the response was YES. Maximal size of possible extension queue 1146. Compared 52304 event pairs, 11 based on Foata normal form. 9/2078 useless extension candidates. Maximal degree in co-relation 18990. Up to 3079 conditions per place. [2022-12-13 11:50:35,378 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 94 transitions, 493 flow [2022-12-13 11:50:35,378 INFO L226 LiptonReduction]: Number of co-enabled transitions 2220 [2022-12-13 11:50:35,382 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:50:35,383 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 392 [2022-12-13 11:50:35,383 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 94 transitions, 493 flow [2022-12-13 11:50:35,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:50:35,383 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:50:35,383 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:50:35,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:50:35,383 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-13 11:50:35,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:35,383 INFO L85 PathProgramCache]: Analyzing trace with hash -2060986765, now seen corresponding path program 1 times [2022-12-13 11:50:35,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:35,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786483387] [2022-12-13 11:50:35,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:35,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:36,881 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:50:36,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:36,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786483387] [2022-12-13 11:50:36,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786483387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:36,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:36,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:50:36,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177279224] [2022-12-13 11:50:36,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:36,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:50:36,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:36,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:50:36,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:50:36,896 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2022-12-13 11:50:36,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 94 transitions, 493 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 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:50:36,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:50:36,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2022-12-13 11:50:36,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:50:40,890 INFO L130 PetriNetUnfolder]: 28999/44004 cut-off events. [2022-12-13 11:50:40,890 INFO L131 PetriNetUnfolder]: For 51444/54160 co-relation queries the response was YES. [2022-12-13 11:50:41,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153959 conditions, 44004 events. 28999/44004 cut-off events. For 51444/54160 co-relation queries the response was YES. Maximal size of possible extension queue 2582. Compared 332986 event pairs, 3724 based on Foata normal form. 1588/34839 useless extension candidates. Maximal degree in co-relation 153936. Up to 14640 conditions per place. [2022-12-13 11:50:41,107 INFO L137 encePairwiseOnDemand]: 41/49 looper letters, 134 selfloop transitions, 8 changer transitions 118/283 dead transitions. [2022-12-13 11:50:41,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 283 transitions, 2061 flow [2022-12-13 11:50:41,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:50:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:50:41,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 213 transitions. [2022-12-13 11:50:41,108 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6209912536443148 [2022-12-13 11:50:41,108 INFO L175 Difference]: Start difference. First operand has 74 places, 94 transitions, 493 flow. Second operand 7 states and 213 transitions. [2022-12-13 11:50:41,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 283 transitions, 2061 flow [2022-12-13 11:50:48,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 283 transitions, 2057 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:50:48,938 INFO L231 Difference]: Finished difference. Result has 82 places, 90 transitions, 472 flow [2022-12-13 11:50:48,939 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=472, PETRI_PLACES=82, PETRI_TRANSITIONS=90} [2022-12-13 11:50:48,939 INFO L295 CegarLoopForPetriNet]: 93 programPoint places, -11 predicate places. [2022-12-13 11:50:48,939 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:50:48,939 INFO L89 Accepts]: Start accepts. Operand has 82 places, 90 transitions, 472 flow [2022-12-13 11:50:48,940 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:50:48,940 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:50:48,940 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 90 transitions, 472 flow [2022-12-13 11:50:48,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 90 transitions, 472 flow [2022-12-13 11:50:49,430 INFO L130 PetriNetUnfolder]: 5608/9719 cut-off events. [2022-12-13 11:50:49,431 INFO L131 PetriNetUnfolder]: For 7863/8120 co-relation queries the response was YES. [2022-12-13 11:50:49,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28724 conditions, 9719 events. 5608/9719 cut-off events. For 7863/8120 co-relation queries the response was YES. Maximal size of possible extension queue 1671. Compared 82919 event pairs, 49 based on Foata normal form. 5/3043 useless extension candidates. Maximal degree in co-relation 28700. Up to 4537 conditions per place. [2022-12-13 11:50:49,523 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 90 transitions, 472 flow [2022-12-13 11:50:49,524 INFO L226 LiptonReduction]: Number of co-enabled transitions 2108 [2022-12-13 11:50:49,847 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:50:49,849 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 910 [2022-12-13 11:50:49,849 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 89 transitions, 477 flow [2022-12-13 11:50:49,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 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:50:49,849 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:50:49,849 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:50:49,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 11:50:49,849 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-13 11:50:49,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:49,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1773756738, now seen corresponding path program 1 times [2022-12-13 11:50:49,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:49,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440980730] [2022-12-13 11:50:49,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:49,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:50:49,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:50:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:50:50,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:50:50,090 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:50:50,090 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2022-12-13 11:50:50,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2022-12-13 11:50:50,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2022-12-13 11:50:50,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 9 remaining) [2022-12-13 11:50:50,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2022-12-13 11:50:50,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2022-12-13 11:50:50,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2022-12-13 11:50:50,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2022-12-13 11:50:50,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2022-12-13 11:50:50,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 11:50:50,095 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:50:50,099 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:50:50,099 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:50:50,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:50:50 BasicIcfg [2022-12-13 11:50:50,253 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:50:50,254 INFO L158 Benchmark]: Toolchain (without parser) took 122324.08ms. Allocated memory was 185.6MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 161.3MB in the beginning and 4.0GB in the end (delta: -3.8GB). Peak memory consumption was 3.5GB. Max. memory is 8.0GB. [2022-12-13 11:50:50,254 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory is still 162.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:50:50,254 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.81ms. Allocated memory is still 185.6MB. Free memory was 160.8MB in the beginning and 127.7MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-13 11:50:50,254 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.82ms. Allocated memory is still 185.6MB. Free memory was 127.7MB in the beginning and 123.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-12-13 11:50:50,254 INFO L158 Benchmark]: Boogie Preprocessor took 53.55ms. Allocated memory is still 185.6MB. Free memory was 123.5MB in the beginning and 120.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:50:50,255 INFO L158 Benchmark]: RCFGBuilder took 748.92ms. Allocated memory is still 185.6MB. Free memory was 120.8MB in the beginning and 98.4MB in the end (delta: 22.5MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-13 11:50:50,255 INFO L158 Benchmark]: TraceAbstraction took 120970.14ms. Allocated memory was 185.6MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 97.3MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 3.5GB. Max. memory is 8.0GB. [2022-12-13 11:50:50,256 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 185.6MB. Free memory is still 162.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 456.81ms. Allocated memory is still 185.6MB. Free memory was 160.8MB in the beginning and 127.7MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 89.82ms. Allocated memory is still 185.6MB. Free memory was 127.7MB in the beginning and 123.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.55ms. Allocated memory is still 185.6MB. Free memory was 123.5MB in the beginning and 120.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 748.92ms. Allocated memory is still 185.6MB. Free memory was 120.8MB in the beginning and 98.4MB in the end (delta: 22.5MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 120970.14ms. Allocated memory was 185.6MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 97.3MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 3.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.8s, 158 PlacesBefore, 93 PlacesAfterwards, 147 TransitionsBefore, 81 TransitionsAfterwards, 3392 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 61 TrivialYvCompositions, 52 ConcurrentYvCompositions, 3 ChoiceCompositions, 117 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5640, independent: 5472, independent conditional: 5472, independent unconditional: 0, dependent: 168, dependent conditional: 168, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5640, independent: 5472, independent conditional: 0, independent unconditional: 5472, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5640, independent: 5472, independent conditional: 0, independent unconditional: 5472, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5640, independent: 5472, independent conditional: 0, independent unconditional: 5472, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3259, independent: 3208, independent conditional: 0, independent unconditional: 3208, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3259, independent: 3189, independent conditional: 0, independent unconditional: 3189, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 70, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 284, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 257, dependent conditional: 0, dependent unconditional: 257, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5640, independent: 2264, independent conditional: 0, independent unconditional: 2264, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 3259, unknown conditional: 0, unknown unconditional: 3259] , Statistics on independence cache: Total cache size (in pairs): 5744, Positive cache size: 5693, Positive conditional cache size: 0, Positive unconditional cache size: 5693, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, 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.6s, 80 PlacesBefore, 80 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 2704 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 571, independent: 489, independent conditional: 489, independent unconditional: 0, dependent: 82, dependent conditional: 82, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 571, independent: 489, independent conditional: 21, independent unconditional: 468, dependent: 82, dependent conditional: 5, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 571, independent: 489, independent conditional: 21, independent unconditional: 468, dependent: 82, dependent conditional: 5, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 571, independent: 489, independent conditional: 21, independent unconditional: 468, dependent: 82, dependent conditional: 5, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 490, independent: 439, independent conditional: 20, independent unconditional: 419, dependent: 51, dependent conditional: 2, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 490, independent: 385, independent conditional: 0, independent unconditional: 385, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 105, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 51, dependent conditional: 2, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 574, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 529, dependent conditional: 8, dependent unconditional: 521, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 571, independent: 50, independent conditional: 1, independent unconditional: 49, dependent: 31, dependent conditional: 3, dependent unconditional: 28, unknown: 490, unknown conditional: 22, unknown unconditional: 468] , Statistics on independence cache: Total cache size (in pairs): 490, Positive cache size: 439, Positive conditional cache size: 20, Positive unconditional cache size: 419, Negative cache size: 51, Negative conditional cache size: 2, Negative unconditional cache size: 49, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 55 PlacesBefore, 55 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 1164 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 429, independent: 381, independent conditional: 381, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 429, independent: 381, independent conditional: 27, independent unconditional: 354, dependent: 48, dependent conditional: 1, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 429, independent: 381, independent conditional: 27, independent unconditional: 354, dependent: 48, dependent conditional: 1, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 429, independent: 381, independent conditional: 27, independent unconditional: 354, dependent: 48, dependent conditional: 1, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 70, independent: 58, independent conditional: 1, independent unconditional: 57, dependent: 12, dependent conditional: 1, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 70, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 12, dependent conditional: 1, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 180, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 163, dependent conditional: 6, dependent unconditional: 157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 429, independent: 323, independent conditional: 26, independent unconditional: 297, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 70, unknown conditional: 2, unknown unconditional: 68] , Statistics on independence cache: Total cache size (in pairs): 560, Positive cache size: 497, Positive conditional cache size: 21, Positive unconditional cache size: 476, Negative cache size: 63, Negative conditional cache size: 3, Negative unconditional cache size: 60, 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, 56 PlacesBefore, 56 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 1158 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 492, independent: 446, independent conditional: 446, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 492, independent: 446, independent conditional: 16, independent unconditional: 430, dependent: 46, dependent conditional: 5, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 492, independent: 446, independent conditional: 0, independent unconditional: 446, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 492, independent: 446, independent conditional: 0, independent unconditional: 446, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 492, independent: 431, independent conditional: 0, independent unconditional: 431, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 581, Positive cache size: 512, Positive conditional cache size: 21, Positive unconditional cache size: 491, Negative cache size: 69, Negative conditional cache size: 3, Negative unconditional cache size: 66, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 1152 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 491, independent: 446, independent conditional: 446, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 491, independent: 446, independent conditional: 10, independent unconditional: 436, dependent: 45, dependent conditional: 3, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 491, independent: 446, independent conditional: 0, independent unconditional: 446, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 491, independent: 446, independent conditional: 0, independent unconditional: 446, dependent: 45, dependent conditional: 0, dependent unconditional: 45, 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: 491, independent: 446, independent conditional: 0, independent unconditional: 446, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 581, Positive cache size: 512, Positive conditional cache size: 21, Positive unconditional cache size: 491, Negative cache size: 69, Negative conditional cache size: 3, Negative unconditional cache size: 66, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 1458 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 296, independent: 253, independent conditional: 253, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 296, independent: 253, independent conditional: 36, independent unconditional: 217, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 296, independent: 253, independent conditional: 36, independent unconditional: 217, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 296, independent: 253, independent conditional: 36, independent unconditional: 217, dependent: 43, dependent conditional: 0, dependent unconditional: 43, 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: 296, independent: 253, independent conditional: 36, independent unconditional: 217, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 581, Positive cache size: 512, Positive conditional cache size: 21, Positive unconditional cache size: 491, Negative cache size: 69, Negative conditional cache size: 3, Negative unconditional cache size: 66, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 61 PlacesBefore, 61 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 1860 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 189, independent conditional: 189, independent unconditional: 0, dependent: 55, dependent conditional: 55, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 244, independent: 189, independent conditional: 28, independent unconditional: 161, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 244, independent: 189, independent conditional: 28, independent unconditional: 161, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 244, independent: 189, independent conditional: 28, independent unconditional: 161, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 11, independent conditional: 3, independent unconditional: 8, 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: 15, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 69, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 244, independent: 178, independent conditional: 25, independent unconditional: 153, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 15, unknown conditional: 3, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 596, Positive cache size: 523, Positive conditional cache size: 24, Positive unconditional cache size: 499, Negative cache size: 73, Negative conditional cache size: 3, Negative unconditional cache size: 70, 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, 64 PlacesBefore, 64 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 1884 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 392, independent: 325, independent conditional: 325, independent unconditional: 0, dependent: 67, dependent conditional: 67, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 392, independent: 325, independent conditional: 105, independent unconditional: 220, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 392, independent: 325, independent conditional: 105, independent unconditional: 220, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 392, independent: 325, independent conditional: 105, independent unconditional: 220, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 10, independent unconditional: 5, 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: 15, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 392, independent: 310, independent conditional: 95, independent unconditional: 215, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 15, unknown conditional: 10, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 611, Positive cache size: 538, Positive conditional cache size: 34, Positive unconditional cache size: 504, Negative cache size: 73, Negative conditional cache size: 3, Negative unconditional cache size: 70, 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, 66 PlacesBefore, 66 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 1924 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 306, independent: 240, independent conditional: 240, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 306, independent: 240, independent conditional: 21, independent unconditional: 219, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 306, independent: 240, independent conditional: 21, independent unconditional: 219, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 306, independent: 240, independent conditional: 21, independent unconditional: 219, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 4, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 306, independent: 237, independent conditional: 21, independent unconditional: 216, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 615, Positive cache size: 541, Positive conditional cache size: 34, Positive unconditional cache size: 507, Negative cache size: 74, Negative conditional cache size: 3, Negative unconditional cache size: 71, 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: 1.5s, 77 PlacesBefore, 76 PlacesAfterwards, 100 TransitionsBefore, 99 TransitionsAfterwards, 2788 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 695, independent: 665, independent conditional: 665, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 695, independent: 665, independent conditional: 381, independent unconditional: 284, dependent: 30, dependent conditional: 10, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 695, independent: 665, independent conditional: 292, independent unconditional: 373, dependent: 30, dependent conditional: 10, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 695, independent: 665, independent conditional: 292, independent unconditional: 373, dependent: 30, dependent conditional: 10, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 68, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 68, dependent conditional: 68, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 695, independent: 653, independent conditional: 280, independent unconditional: 373, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 679, Positive cache size: 597, Positive conditional cache size: 46, Positive unconditional cache size: 551, Negative cache size: 82, Negative conditional cache size: 11, Negative unconditional cache size: 71, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 89, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 77 PlacesBefore, 74 PlacesAfterwards, 96 TransitionsBefore, 93 TransitionsAfterwards, 2290 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 906, independent: 876, independent conditional: 876, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 906, independent: 876, independent conditional: 514, independent unconditional: 362, dependent: 30, dependent conditional: 8, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 906, independent: 876, independent conditional: 504, independent unconditional: 372, dependent: 30, dependent conditional: 8, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 906, independent: 876, independent conditional: 504, independent unconditional: 372, dependent: 30, dependent conditional: 8, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, independent: 27, independent conditional: 18, independent unconditional: 9, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 906, independent: 849, independent conditional: 486, independent unconditional: 363, dependent: 27, dependent conditional: 5, dependent unconditional: 22, unknown: 30, unknown conditional: 21, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 867, Positive cache size: 782, Positive conditional cache size: 75, Positive unconditional cache size: 707, Negative cache size: 85, Negative conditional cache size: 14, Negative unconditional cache size: 71, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 74 PlacesBefore, 74 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 2220 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 212, independent: 202, independent conditional: 202, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 212, independent: 202, independent conditional: 129, independent unconditional: 73, dependent: 10, dependent conditional: 5, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 212, independent: 202, independent conditional: 113, independent unconditional: 89, dependent: 10, dependent conditional: 5, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 212, independent: 202, independent conditional: 113, independent unconditional: 89, dependent: 10, dependent conditional: 5, dependent unconditional: 5, 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: 212, independent: 202, independent conditional: 113, independent unconditional: 89, dependent: 10, dependent conditional: 5, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 867, Positive cache size: 782, Positive conditional cache size: 75, Positive unconditional cache size: 707, Negative cache size: 85, Negative conditional cache size: 14, Negative unconditional cache size: 71, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 80 PlacesBefore, 79 PlacesAfterwards, 90 TransitionsBefore, 89 TransitionsAfterwards, 2108 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 229, independent: 229, independent conditional: 229, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 229, independent: 229, independent conditional: 189, independent unconditional: 40, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 229, independent: 229, independent conditional: 181, independent unconditional: 48, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 229, independent: 229, independent conditional: 181, independent unconditional: 48, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 3, independent unconditional: 5, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 229, independent: 221, independent conditional: 178, independent unconditional: 43, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1034, Positive cache size: 949, Positive conditional cache size: 83, Positive unconditional cache size: 866, Negative cache size: 85, Negative conditional cache size: 14, Negative unconditional cache size: 71, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, 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_p1_EAX = 0; [L714] 0 int __unbuffered_p1_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; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice2; [L920] 0 pthread_t t625; [L921] FCALL, FORK 0 pthread_create(&t625, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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(&t625, ((void *)0), P0, ((void *)0))=14, t625={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=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] [L922] 0 pthread_t t626; [L923] FCALL, FORK 0 pthread_create(&t626, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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(&t626, ((void *)0), P1, ((void *)0))=15, t625={7:0}, t626={8:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=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] [L924] 0 pthread_t t627; [L790] 2 x$w_buff1 = x$w_buff0 [L791] 2 x$w_buff0 = 2 [L792] 2 x$w_buff1_used = x$w_buff0_used [L793] 2 x$w_buff0_used = (_Bool)1 [L794] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L794] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L795] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L796] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L797] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L798] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L799] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L800] 2 x$r_buff0_thd2 = (_Bool)1 [L803] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 2 x$flush_delayed = weak$$choice2 [L806] 2 x$mem_tmp = x [L807] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L808] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L809] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L810] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L811] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L812] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L813] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L814] 2 __unbuffered_p1_EAX = x [L815] 2 x = x$flush_delayed ? x$mem_tmp : x [L816] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_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, weak$$choice0=51, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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] [L819] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_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, weak$$choice0=51, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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] [L925] FCALL, FORK 0 pthread_create(&t627, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_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(&t627, ((void *)0), P2, ((void *)0))=16, t625={7:0}, t626={8:0}, t627={9:0}, weak$$choice0=51, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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] [L926] 0 pthread_t t628; [L927] FCALL, FORK 0 pthread_create(&t628, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_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(&t628, ((void *)0), P3, ((void *)0))=17, t625={7:0}, t626={8:0}, t627={9:0}, t628={5:0}, weak$$choice0=51, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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] [L836] 3 y = 1 [L839] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_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, weak$$choice0=51, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, 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=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] [L842] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L843] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L844] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L845] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L846] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L847] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L848] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L849] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L850] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L851] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_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, weak$$choice0=51, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, 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=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] [L861] 4 z$w_buff1 = z$w_buff0 [L862] 4 z$w_buff0 = 2 [L863] 4 z$w_buff1_used = z$w_buff0_used [L864] 4 z$w_buff0_used = (_Bool)1 [L865] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L865] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L866] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L867] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L868] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L869] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L870] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L871] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L874] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 4 z$flush_delayed = weak$$choice2 [L877] 4 z$mem_tmp = z [L878] 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) [L879] 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)) [L880] 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)) [L881] 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)) [L882] 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)) [L883] 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)) [L884] 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)) [L885] 4 __unbuffered_p3_EAX = z [L886] 4 z = z$flush_delayed ? z$mem_tmp : z [L887] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2, z$flush_delayed=0, z$mem_tmp=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L890] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2, z$flush_delayed=0, z$mem_tmp=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 1 a = 1 [L773] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2, z$flush_delayed=0, z$mem_tmp=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L823] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L824] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L825] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L826] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2, z$flush_delayed=0, z$mem_tmp=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L777] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L778] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L779] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L780] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2, z$flush_delayed=0, z$mem_tmp=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L893] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L894] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L895] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L896] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L897] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L898] 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) [L899] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L900] 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 [L901] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L902] 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2, z$flush_delayed=0, z$mem_tmp=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2, z$flush_delayed=0, z$mem_tmp=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2, z$flush_delayed=0, z$mem_tmp=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2, z$flush_delayed=0, z$mem_tmp=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L905] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2, z$flush_delayed=0, z$mem_tmp=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L929] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L931] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L931] RET 0 assume_abort_if_not(main$tmp_guard0) [L933] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L934] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L935] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L936] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L937] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L938] 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) [L939] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L940] 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 [L941] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L942] 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 [L945] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L946] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L947] 0 z$flush_delayed = weak$$choice2 [L948] 0 z$mem_tmp = z [L949] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L950] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L951] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L952] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L953] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L954] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L955] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L956] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L957] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L958] 0 x$flush_delayed = weak$$choice2 [L959] 0 x$mem_tmp = x [L960] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L961] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L962] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L963] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L964] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L965] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L966] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L967] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L968] 0 z = z$flush_delayed ? z$mem_tmp : z [L969] 0 z$flush_delayed = (_Bool)0 [L970] 0 x = x$flush_delayed ? x$mem_tmp : x [L971] 0 x$flush_delayed = (_Bool)0 [L973] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, 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=2, 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: 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: 923]: 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: 927]: 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: 921]: 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: 925]: 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, 190 locations, 9 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: 120.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 70.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 17.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 706 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 706 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 198 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1748 IncrementalHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 198 mSolverCounterUnsat, 15 mSDtfsCounter, 1748 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=628occurred in iteration=10, InterpolantAutomatonStates: 53, 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.5s SatisfiabilityAnalysisTime, 22.5s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 3452 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:50:50,280 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...