/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:46:08,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:46:08,120 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:46:08,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:46:08,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:46:08,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:46:08,165 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:46:08,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:46:08,172 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:46:08,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:46:08,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:46:08,177 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:46:08,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:46:08,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:46:08,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:46:08,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:46:08,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:46:08,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:46:08,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:46:08,193 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:46:08,194 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:46:08,196 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:46:08,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:46:08,197 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:46:08,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:46:08,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:46:08,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:46:08,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:46:08,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:46:08,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:46:08,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:46:08,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:46:08,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:46:08,206 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:46:08,207 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:46:08,207 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:46:08,208 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:46:08,208 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:46:08,208 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:46:08,209 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:46:08,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:46:08,214 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-RepeatedSemanticLbe.epf [2022-12-13 00:46:08,245 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:46:08,245 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:46:08,247 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:46:08,248 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:46:08,248 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:46:08,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:46:08,249 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:46:08,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:46:08,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:46:08,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:46:08,250 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:46:08,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:46:08,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:46:08,250 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:46:08,250 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:46:08,251 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:46:08,251 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:46:08,251 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:46:08,251 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:46:08,251 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:46:08,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:46:08,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:46:08,252 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:46:08,252 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:46:08,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:46:08,252 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:46:08,252 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:46:08,252 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:46:08,253 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 00:46:08,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:46:08,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:46:08,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:46:08,580 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:46:08,580 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:46:08,582 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-13 00:46:09,645 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:46:09,906 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:46:09,907 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-13 00:46:09,918 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12996c8b6/baa771f63d1843e49c8294f0a1cad0aa/FLAG3e33a2b51 [2022-12-13 00:46:09,931 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12996c8b6/baa771f63d1843e49c8294f0a1cad0aa [2022-12-13 00:46:09,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:46:09,935 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:46:09,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:46:09,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:46:09,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:46:09,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:46:09" (1/1) ... [2022-12-13 00:46:09,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef6dd63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:09, skipping insertion in model container [2022-12-13 00:46:09,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:46:09" (1/1) ... [2022-12-13 00:46:09,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:46:09,990 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:46:10,124 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/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-13 00:46:10,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:46:10,368 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:46:10,378 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/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-13 00:46:10,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:10,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:10,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:46:10,493 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:46:10,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:10 WrapperNode [2022-12-13 00:46:10,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:46:10,495 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:46:10,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:46:10,495 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:46:10,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:10" (1/1) ... [2022-12-13 00:46:10,518 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:10" (1/1) ... [2022-12-13 00:46:10,542 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 157 [2022-12-13 00:46:10,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:46:10,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:46:10,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:46:10,547 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:46:10,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:10" (1/1) ... [2022-12-13 00:46:10,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:10" (1/1) ... [2022-12-13 00:46:10,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:10" (1/1) ... [2022-12-13 00:46:10,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:10" (1/1) ... [2022-12-13 00:46:10,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:10" (1/1) ... [2022-12-13 00:46:10,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:10" (1/1) ... [2022-12-13 00:46:10,570 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:10" (1/1) ... [2022-12-13 00:46:10,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:10" (1/1) ... [2022-12-13 00:46:10,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:46:10,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:46:10,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:46:10,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:46:10,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:10" (1/1) ... [2022-12-13 00:46:10,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:46:10,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:46:10,621 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 00:46:10,643 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 00:46:10,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:46:10,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:46:10,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:46:10,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:46:10,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:46:10,658 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:46:10,658 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:46:10,659 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:46:10,659 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:46:10,659 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:46:10,659 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:46:10,659 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 00:46:10,659 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 00:46:10,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:46:10,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:46:10,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:46:10,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:46:10,661 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 00:46:10,803 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:46:10,805 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:46:11,163 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:46:11,263 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:46:11,263 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:46:11,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:46:11 BoogieIcfgContainer [2022-12-13 00:46:11,266 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:46:11,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:46:11,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:46:11,270 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:46:11,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:46:09" (1/3) ... [2022-12-13 00:46:11,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a589cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:46:11, skipping insertion in model container [2022-12-13 00:46:11,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:10" (2/3) ... [2022-12-13 00:46:11,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a589cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:46:11, skipping insertion in model container [2022-12-13 00:46:11,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:46:11" (3/3) ... [2022-12-13 00:46:11,273 INFO L112 eAbstractionObserver]: Analyzing ICFG mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-13 00:46:11,288 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:46:11,289 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:46:11,289 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:46:11,348 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:46:11,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 270 flow [2022-12-13 00:46:11,464 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-12-13 00:46:11,464 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:46:11,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-13 00:46:11,472 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 125 transitions, 270 flow [2022-12-13 00:46:11,479 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 121 transitions, 254 flow [2022-12-13 00:46:11,480 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:11,507 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 121 transitions, 254 flow [2022-12-13 00:46:11,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 121 transitions, 254 flow [2022-12-13 00:46:11,558 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-12-13 00:46:11,559 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:46:11,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-13 00:46:11,564 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 121 transitions, 254 flow [2022-12-13 00:46:11,565 INFO L226 LiptonReduction]: Number of co-enabled transitions 2736 [2022-12-13 00:46:21,598 INFO L241 LiptonReduction]: Total number of compositions: 96 [2022-12-13 00:46:21,611 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:46:21,617 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;@4774490e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:46:21,617 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 00:46:21,624 INFO L130 PetriNetUnfolder]: 1/36 cut-off events. [2022-12-13 00:46:21,624 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:46:21,624 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:21,625 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:21,625 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:46:21,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:21,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1390687954, now seen corresponding path program 1 times [2022-12-13 00:46:21,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:21,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569481053] [2022-12-13 00:46:21,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:21,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:22,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 00:46:22,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:22,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569481053] [2022-12-13 00:46:22,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569481053] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:22,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:22,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:46:22,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837718117] [2022-12-13 00:46:22,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:22,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:46:22,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:22,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:46:22,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:46:22,141 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 66 [2022-12-13 00:46:22,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 144 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 00:46:22,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:22,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 66 [2022-12-13 00:46:22,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:27,207 INFO L130 PetriNetUnfolder]: 34743/50793 cut-off events. [2022-12-13 00:46:27,207 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-12-13 00:46:27,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97145 conditions, 50793 events. 34743/50793 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 3236. Compared 400318 event pairs, 5495 based on Foata normal form. 0/30962 useless extension candidates. Maximal degree in co-relation 97133. Up to 38209 conditions per place. [2022-12-13 00:46:27,410 INFO L137 encePairwiseOnDemand]: 60/66 looper letters, 36 selfloop transitions, 2 changer transitions 48/99 dead transitions. [2022-12-13 00:46:27,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 99 transitions, 382 flow [2022-12-13 00:46:27,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:46:27,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:46:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2022-12-13 00:46:27,424 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 00:46:27,427 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 144 flow. Second operand 3 states and 132 transitions. [2022-12-13 00:46:27,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 99 transitions, 382 flow [2022-12-13 00:46:27,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 99 transitions, 378 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 00:46:27,436 INFO L231 Difference]: Finished difference. Result has 73 places, 38 transitions, 88 flow [2022-12-13 00:46:27,438 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=73, PETRI_TRANSITIONS=38} [2022-12-13 00:46:27,442 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -5 predicate places. [2022-12-13 00:46:27,442 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:27,443 INFO L89 Accepts]: Start accepts. Operand has 73 places, 38 transitions, 88 flow [2022-12-13 00:46:27,447 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:27,447 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:27,447 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 38 transitions, 88 flow [2022-12-13 00:46:27,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 38 transitions, 88 flow [2022-12-13 00:46:27,465 INFO L130 PetriNetUnfolder]: 0/38 cut-off events. [2022-12-13 00:46:27,465 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:46:27,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 94 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:46:27,469 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 38 transitions, 88 flow [2022-12-13 00:46:27,469 INFO L226 LiptonReduction]: Number of co-enabled transitions 862 [2022-12-13 00:46:27,721 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:46:27,723 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 281 [2022-12-13 00:46:27,723 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 88 flow [2022-12-13 00:46:27,724 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 00:46:27,724 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:27,724 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:27,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:46:27,728 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:46:27,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:27,729 INFO L85 PathProgramCache]: Analyzing trace with hash 716244204, now seen corresponding path program 1 times [2022-12-13 00:46:27,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:27,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935679047] [2022-12-13 00:46:27,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:27,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:28,523 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 00:46:28,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:28,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935679047] [2022-12-13 00:46:28,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935679047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:28,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:28,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:46:28,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319508767] [2022-12-13 00:46:28,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:28,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:46:28,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:28,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:46:28,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:46:28,526 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2022-12-13 00:46:28,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:28,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:28,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2022-12-13 00:46:28,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:31,051 INFO L130 PetriNetUnfolder]: 19687/28205 cut-off events. [2022-12-13 00:46:31,051 INFO L131 PetriNetUnfolder]: For 1032/1032 co-relation queries the response was YES. [2022-12-13 00:46:31,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56509 conditions, 28205 events. 19687/28205 cut-off events. For 1032/1032 co-relation queries the response was YES. Maximal size of possible extension queue 1113. Compared 177354 event pairs, 1777 based on Foata normal form. 828/23721 useless extension candidates. Maximal degree in co-relation 56499. Up to 16343 conditions per place. [2022-12-13 00:46:31,258 INFO L137 encePairwiseOnDemand]: 27/38 looper letters, 62 selfloop transitions, 12 changer transitions 0/83 dead transitions. [2022-12-13 00:46:31,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 83 transitions, 340 flow [2022-12-13 00:46:31,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:46:31,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:46:31,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-12-13 00:46:31,261 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7368421052631579 [2022-12-13 00:46:31,261 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 88 flow. Second operand 4 states and 112 transitions. [2022-12-13 00:46:31,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 83 transitions, 340 flow [2022-12-13 00:46:31,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 83 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:46:31,266 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 176 flow [2022-12-13 00:46:31,266 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2022-12-13 00:46:31,267 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -25 predicate places. [2022-12-13 00:46:31,267 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:31,267 INFO L89 Accepts]: Start accepts. Operand has 53 places, 49 transitions, 176 flow [2022-12-13 00:46:31,268 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:31,269 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:31,269 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 49 transitions, 176 flow [2022-12-13 00:46:31,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 49 transitions, 176 flow [2022-12-13 00:46:31,369 INFO L130 PetriNetUnfolder]: 562/1428 cut-off events. [2022-12-13 00:46:31,369 INFO L131 PetriNetUnfolder]: For 291/327 co-relation queries the response was YES. [2022-12-13 00:46:31,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2800 conditions, 1428 events. 562/1428 cut-off events. For 291/327 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 11478 event pairs, 218 based on Foata normal form. 0/1059 useless extension candidates. Maximal degree in co-relation 2790. Up to 626 conditions per place. [2022-12-13 00:46:31,386 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 49 transitions, 176 flow [2022-12-13 00:46:31,386 INFO L226 LiptonReduction]: Number of co-enabled transitions 1174 [2022-12-13 00:46:31,401 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:46:31,402 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 00:46:31,403 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 176 flow [2022-12-13 00:46:31,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:31,404 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:31,404 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:31,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:46:31,405 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:46:31,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:31,406 INFO L85 PathProgramCache]: Analyzing trace with hash 728734398, now seen corresponding path program 1 times [2022-12-13 00:46:31,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:31,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093510758] [2022-12-13 00:46:31,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:31,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:31,572 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 00:46:31,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:31,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093510758] [2022-12-13 00:46:31,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093510758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:31,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:31,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:46:31,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642352583] [2022-12-13 00:46:31,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:31,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:46:31,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:31,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:46:31,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:46:31,574 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2022-12-13 00:46:31,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 176 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 00:46:31,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:31,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2022-12-13 00:46:31,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:32,982 INFO L130 PetriNetUnfolder]: 14443/21537 cut-off events. [2022-12-13 00:46:32,982 INFO L131 PetriNetUnfolder]: For 12316/12330 co-relation queries the response was YES. [2022-12-13 00:46:33,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54668 conditions, 21537 events. 14443/21537 cut-off events. For 12316/12330 co-relation queries the response was YES. Maximal size of possible extension queue 1052. Compared 146160 event pairs, 3142 based on Foata normal form. 60/16926 useless extension candidates. Maximal degree in co-relation 54655. Up to 18359 conditions per place. [2022-12-13 00:46:33,264 INFO L137 encePairwiseOnDemand]: 34/38 looper letters, 52 selfloop transitions, 5 changer transitions 0/72 dead transitions. [2022-12-13 00:46:33,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 380 flow [2022-12-13 00:46:33,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:46:33,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:46:33,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2022-12-13 00:46:33,270 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6929824561403509 [2022-12-13 00:46:33,271 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 176 flow. Second operand 3 states and 79 transitions. [2022-12-13 00:46:33,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 380 flow [2022-12-13 00:46:33,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 380 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:46:33,277 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 221 flow [2022-12-13 00:46:33,277 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=221, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2022-12-13 00:46:33,278 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -22 predicate places. [2022-12-13 00:46:33,278 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:33,278 INFO L89 Accepts]: Start accepts. Operand has 56 places, 53 transitions, 221 flow [2022-12-13 00:46:33,280 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:33,280 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:33,280 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 53 transitions, 221 flow [2022-12-13 00:46:33,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 53 transitions, 221 flow [2022-12-13 00:46:33,377 INFO L130 PetriNetUnfolder]: 528/1366 cut-off events. [2022-12-13 00:46:33,378 INFO L131 PetriNetUnfolder]: For 503/542 co-relation queries the response was YES. [2022-12-13 00:46:33,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2937 conditions, 1366 events. 528/1366 cut-off events. For 503/542 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 10957 event pairs, 162 based on Foata normal form. 3/1012 useless extension candidates. Maximal degree in co-relation 2924. Up to 579 conditions per place. [2022-12-13 00:46:33,394 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 53 transitions, 221 flow [2022-12-13 00:46:33,394 INFO L226 LiptonReduction]: Number of co-enabled transitions 1266 [2022-12-13 00:46:33,400 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:46:33,401 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 00:46:33,401 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 221 flow [2022-12-13 00:46:33,402 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 00:46:33,402 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:33,402 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:33,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:46:33,402 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:46:33,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:33,403 INFO L85 PathProgramCache]: Analyzing trace with hash 464192056, now seen corresponding path program 1 times [2022-12-13 00:46:33,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:33,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919057811] [2022-12-13 00:46:33,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:33,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:33,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:33,946 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 00:46:33,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:33,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919057811] [2022-12-13 00:46:33,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919057811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:33,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:33,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:46:33,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894491651] [2022-12-13 00:46:33,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:33,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:46:33,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:33,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:46:33,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:46:33,948 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2022-12-13 00:46:33,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 221 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:33,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:33,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2022-12-13 00:46:33,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:36,414 INFO L130 PetriNetUnfolder]: 26412/38450 cut-off events. [2022-12-13 00:46:36,415 INFO L131 PetriNetUnfolder]: For 22790/22790 co-relation queries the response was YES. [2022-12-13 00:46:36,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99663 conditions, 38450 events. 26412/38450 cut-off events. For 22790/22790 co-relation queries the response was YES. Maximal size of possible extension queue 1589. Compared 259679 event pairs, 5666 based on Foata normal form. 540/30989 useless extension candidates. Maximal degree in co-relation 99647. Up to 16222 conditions per place. [2022-12-13 00:46:36,685 INFO L137 encePairwiseOnDemand]: 27/38 looper letters, 70 selfloop transitions, 20 changer transitions 0/99 dead transitions. [2022-12-13 00:46:36,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 99 transitions, 552 flow [2022-12-13 00:46:36,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:46:36,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:46:36,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-12-13 00:46:36,687 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7368421052631579 [2022-12-13 00:46:36,688 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 221 flow. Second operand 4 states and 112 transitions. [2022-12-13 00:46:36,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 99 transitions, 552 flow [2022-12-13 00:46:36,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 99 transitions, 546 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:46:36,703 INFO L231 Difference]: Finished difference. Result has 61 places, 64 transitions, 382 flow [2022-12-13 00:46:36,703 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=382, PETRI_PLACES=61, PETRI_TRANSITIONS=64} [2022-12-13 00:46:36,706 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -17 predicate places. [2022-12-13 00:46:36,706 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:36,706 INFO L89 Accepts]: Start accepts. Operand has 61 places, 64 transitions, 382 flow [2022-12-13 00:46:36,707 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:36,707 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:36,707 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 64 transitions, 382 flow [2022-12-13 00:46:36,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 64 transitions, 382 flow [2022-12-13 00:46:37,058 INFO L130 PetriNetUnfolder]: 599/1620 cut-off events. [2022-12-13 00:46:37,059 INFO L131 PetriNetUnfolder]: For 1698/1973 co-relation queries the response was YES. [2022-12-13 00:46:37,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4403 conditions, 1620 events. 599/1620 cut-off events. For 1698/1973 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 13855 event pairs, 203 based on Foata normal form. 0/1185 useless extension candidates. Maximal degree in co-relation 4386. Up to 700 conditions per place. [2022-12-13 00:46:37,081 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 64 transitions, 382 flow [2022-12-13 00:46:37,081 INFO L226 LiptonReduction]: Number of co-enabled transitions 1494 [2022-12-13 00:46:37,088 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:46:37,096 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 390 [2022-12-13 00:46:37,096 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 64 transitions, 382 flow [2022-12-13 00:46:37,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:37,096 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:37,096 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:37,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:46:37,097 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:46:37,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:37,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1123269538, now seen corresponding path program 1 times [2022-12-13 00:46:37,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:37,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410850140] [2022-12-13 00:46:37,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:37,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:37,513 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 00:46:37,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:37,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410850140] [2022-12-13 00:46:37,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410850140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:37,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:37,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:46:37,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053585357] [2022-12-13 00:46:37,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:37,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:46:37,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:37,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:46:37,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:46:37,515 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2022-12-13 00:46:37,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 64 transitions, 382 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 00:46:37,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:37,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2022-12-13 00:46:37,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:39,850 INFO L130 PetriNetUnfolder]: 21040/32074 cut-off events. [2022-12-13 00:46:39,850 INFO L131 PetriNetUnfolder]: For 50482/51334 co-relation queries the response was YES. [2022-12-13 00:46:39,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92513 conditions, 32074 events. 21040/32074 cut-off events. For 50482/51334 co-relation queries the response was YES. Maximal size of possible extension queue 1677. Compared 235813 event pairs, 5321 based on Foata normal form. 457/25613 useless extension candidates. Maximal degree in co-relation 92493. Up to 26774 conditions per place. [2022-12-13 00:46:40,048 INFO L137 encePairwiseOnDemand]: 34/38 looper letters, 59 selfloop transitions, 6 changer transitions 0/86 dead transitions. [2022-12-13 00:46:40,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 86 transitions, 644 flow [2022-12-13 00:46:40,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:46:40,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:46:40,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-12-13 00:46:40,050 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 00:46:40,050 INFO L175 Difference]: Start difference. First operand has 61 places, 64 transitions, 382 flow. Second operand 3 states and 76 transitions. [2022-12-13 00:46:40,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 86 transitions, 644 flow [2022-12-13 00:46:40,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 86 transitions, 632 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-13 00:46:40,096 INFO L231 Difference]: Finished difference. Result has 64 places, 68 transitions, 428 flow [2022-12-13 00:46:40,097 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=428, PETRI_PLACES=64, PETRI_TRANSITIONS=68} [2022-12-13 00:46:40,099 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -14 predicate places. [2022-12-13 00:46:40,099 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:40,099 INFO L89 Accepts]: Start accepts. Operand has 64 places, 68 transitions, 428 flow [2022-12-13 00:46:40,100 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:40,100 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:40,101 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 68 transitions, 428 flow [2022-12-13 00:46:40,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 68 transitions, 428 flow [2022-12-13 00:46:40,306 INFO L130 PetriNetUnfolder]: 730/2036 cut-off events. [2022-12-13 00:46:40,306 INFO L131 PetriNetUnfolder]: For 2581/2909 co-relation queries the response was YES. [2022-12-13 00:46:40,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5649 conditions, 2036 events. 730/2036 cut-off events. For 2581/2909 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 18369 event pairs, 238 based on Foata normal form. 2/1484 useless extension candidates. Maximal degree in co-relation 5629. Up to 856 conditions per place. [2022-12-13 00:46:40,326 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 68 transitions, 428 flow [2022-12-13 00:46:40,326 INFO L226 LiptonReduction]: Number of co-enabled transitions 1594 [2022-12-13 00:46:40,332 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:46:40,333 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 234 [2022-12-13 00:46:40,333 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 68 transitions, 428 flow [2022-12-13 00:46:40,333 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 00:46:40,333 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:40,333 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:40,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:46:40,333 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:46:40,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:40,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1694980572, now seen corresponding path program 1 times [2022-12-13 00:46:40,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:40,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135423061] [2022-12-13 00:46:40,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:40,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:40,602 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 00:46:40,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:40,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135423061] [2022-12-13 00:46:40,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135423061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:40,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:40,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:46:40,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874424494] [2022-12-13 00:46:40,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:40,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:46:40,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:40,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:46:40,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:46:40,609 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2022-12-13 00:46:40,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 68 transitions, 428 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 00:46:40,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:40,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2022-12-13 00:46:40,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:43,124 INFO L130 PetriNetUnfolder]: 21106/32244 cut-off events. [2022-12-13 00:46:43,124 INFO L131 PetriNetUnfolder]: For 56165/57109 co-relation queries the response was YES. [2022-12-13 00:46:43,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96273 conditions, 32244 events. 21106/32244 cut-off events. For 56165/57109 co-relation queries the response was YES. Maximal size of possible extension queue 1637. Compared 238693 event pairs, 3637 based on Foata normal form. 497/25997 useless extension candidates. Maximal degree in co-relation 96250. Up to 22542 conditions per place. [2022-12-13 00:46:43,316 INFO L137 encePairwiseOnDemand]: 32/38 looper letters, 71 selfloop transitions, 18 changer transitions 0/110 dead transitions. [2022-12-13 00:46:43,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 110 transitions, 856 flow [2022-12-13 00:46:43,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:46:43,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:46:43,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2022-12-13 00:46:43,318 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6644736842105263 [2022-12-13 00:46:43,318 INFO L175 Difference]: Start difference. First operand has 64 places, 68 transitions, 428 flow. Second operand 4 states and 101 transitions. [2022-12-13 00:46:43,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 110 transitions, 856 flow [2022-12-13 00:46:43,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 110 transitions, 812 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:46:43,358 INFO L231 Difference]: Finished difference. Result has 66 places, 77 transitions, 530 flow [2022-12-13 00:46:43,358 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=530, PETRI_PLACES=66, PETRI_TRANSITIONS=77} [2022-12-13 00:46:43,358 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -12 predicate places. [2022-12-13 00:46:43,359 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:43,359 INFO L89 Accepts]: Start accepts. Operand has 66 places, 77 transitions, 530 flow [2022-12-13 00:46:43,359 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:43,360 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:43,360 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 77 transitions, 530 flow [2022-12-13 00:46:43,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 77 transitions, 530 flow [2022-12-13 00:46:43,608 INFO L130 PetriNetUnfolder]: 762/2100 cut-off events. [2022-12-13 00:46:43,608 INFO L131 PetriNetUnfolder]: For 3430/3777 co-relation queries the response was YES. [2022-12-13 00:46:43,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6203 conditions, 2100 events. 762/2100 cut-off events. For 3430/3777 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 18981 event pairs, 140 based on Foata normal form. 25/1561 useless extension candidates. Maximal degree in co-relation 6182. Up to 894 conditions per place. [2022-12-13 00:46:43,630 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 77 transitions, 530 flow [2022-12-13 00:46:43,631 INFO L226 LiptonReduction]: Number of co-enabled transitions 1776 [2022-12-13 00:46:43,766 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [499] $Ultimate##0-->L807: Formula: (and (= v_~z$r_buff0_thd4~0_56 1) (= v_~z$r_buff0_thd4~0_57 v_~z$r_buff1_thd4~0_49) (= v_~z$w_buff0~0_149 v_~z$w_buff1~0_129) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_13| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_13|) (= v_~z$r_buff0_thd3~0_47 v_~z$r_buff1_thd3~0_53) (= v_~z$w_buff0_used~0_230 v_~z$w_buff1_used~0_206) (= v_~z$w_buff0_used~0_229 1) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_13| 0)) (= v_~z$w_buff0~0_148 2) (= v_~z$r_buff0_thd2~0_19 v_~z$r_buff1_thd2~0_23) (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_206 256) 0)) (not (= (mod v_~z$w_buff0_used~0_229 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_13|) (= |v_P3Thread1of1ForFork2_~arg#1.offset_7| |v_P3Thread1of1ForFork2_#in~arg#1.offset_7|) (= |v_P3Thread1of1ForFork2_#in~arg#1.base_7| |v_P3Thread1of1ForFork2_~arg#1.base_7|) (= v_~z$r_buff0_thd0~0_157 v_~z$r_buff1_thd0~0_156) (= v_~z$r_buff0_thd1~0_25 v_~z$r_buff1_thd1~0_21)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_157, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_230, ~z$w_buff0~0=v_~z$w_buff0~0_149, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_7|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_57, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_19} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_49, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_229, ~z$w_buff0~0=v_~z$w_buff0~0_148, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_53, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_206, ~z$w_buff1~0=v_~z$w_buff1~0_129, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_13|, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_13|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_157, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_7|, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_7|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_156, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_21, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_56, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_19} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0] [2022-12-13 00:46:43,957 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [245] L846-->L852: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd0~0_50 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_48 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_95 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_96 256) 0)))) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse4))) (and (= v_~z$w_buff0_used~0_95 (ite .cse0 0 v_~z$w_buff0_used~0_96)) (= v_~z$w_buff1_used~0_82 (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_83)) (= v_~z$r_buff0_thd0~0_47 (ite .cse1 0 v_~z$r_buff0_thd0~0_48)) (= v_~z$r_buff1_thd0~0_49 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_47 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse4)) 0 v_~z$r_buff1_thd0~0_50)) (= v_~z~0_53 (ite .cse0 v_~z$w_buff0~0_38 (ite .cse2 v_~z$w_buff1~0_29 v_~z~0_54)))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_48, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_96, ~z$w_buff0~0=v_~z$w_buff0~0_38, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$w_buff1~0=v_~z$w_buff1~0_29, ~z~0=v_~z~0_54} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_95, ~z$w_buff0~0=v_~z$w_buff0~0_38, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_49, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$w_buff1~0=v_~z$w_buff1~0_29, ~z~0=v_~z~0_53} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0] [2022-12-13 00:46:44,034 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [499] $Ultimate##0-->L807: Formula: (and (= v_~z$r_buff0_thd4~0_56 1) (= v_~z$r_buff0_thd4~0_57 v_~z$r_buff1_thd4~0_49) (= v_~z$w_buff0~0_149 v_~z$w_buff1~0_129) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_13| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_13|) (= v_~z$r_buff0_thd3~0_47 v_~z$r_buff1_thd3~0_53) (= v_~z$w_buff0_used~0_230 v_~z$w_buff1_used~0_206) (= v_~z$w_buff0_used~0_229 1) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_13| 0)) (= v_~z$w_buff0~0_148 2) (= v_~z$r_buff0_thd2~0_19 v_~z$r_buff1_thd2~0_23) (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_206 256) 0)) (not (= (mod v_~z$w_buff0_used~0_229 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_13|) (= |v_P3Thread1of1ForFork2_~arg#1.offset_7| |v_P3Thread1of1ForFork2_#in~arg#1.offset_7|) (= |v_P3Thread1of1ForFork2_#in~arg#1.base_7| |v_P3Thread1of1ForFork2_~arg#1.base_7|) (= v_~z$r_buff0_thd0~0_157 v_~z$r_buff1_thd0~0_156) (= v_~z$r_buff0_thd1~0_25 v_~z$r_buff1_thd1~0_21)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_157, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_230, ~z$w_buff0~0=v_~z$w_buff0~0_149, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_7|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_57, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_19} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_49, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_229, ~z$w_buff0~0=v_~z$w_buff0~0_148, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_53, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_206, ~z$w_buff1~0=v_~z$w_buff1~0_129, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_13|, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_13|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_157, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_7|, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_7|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_156, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_21, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_56, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_19} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0] [2022-12-13 00:46:44,147 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [245] L846-->L852: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd0~0_50 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_48 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_95 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_96 256) 0)))) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse4))) (and (= v_~z$w_buff0_used~0_95 (ite .cse0 0 v_~z$w_buff0_used~0_96)) (= v_~z$w_buff1_used~0_82 (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_83)) (= v_~z$r_buff0_thd0~0_47 (ite .cse1 0 v_~z$r_buff0_thd0~0_48)) (= v_~z$r_buff1_thd0~0_49 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_47 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse4)) 0 v_~z$r_buff1_thd0~0_50)) (= v_~z~0_53 (ite .cse0 v_~z$w_buff0~0_38 (ite .cse2 v_~z$w_buff1~0_29 v_~z~0_54)))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_48, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_96, ~z$w_buff0~0=v_~z$w_buff0~0_38, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$w_buff1~0=v_~z$w_buff1~0_29, ~z~0=v_~z~0_54} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_95, ~z$w_buff0~0=v_~z$w_buff0~0_38, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_49, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$w_buff1~0=v_~z$w_buff1~0_29, ~z~0=v_~z~0_53} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0] [2022-12-13 00:46:44,270 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [245] L846-->L852: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd0~0_50 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_48 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_95 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_96 256) 0)))) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse4))) (and (= v_~z$w_buff0_used~0_95 (ite .cse0 0 v_~z$w_buff0_used~0_96)) (= v_~z$w_buff1_used~0_82 (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_83)) (= v_~z$r_buff0_thd0~0_47 (ite .cse1 0 v_~z$r_buff0_thd0~0_48)) (= v_~z$r_buff1_thd0~0_49 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_47 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse4)) 0 v_~z$r_buff1_thd0~0_50)) (= v_~z~0_53 (ite .cse0 v_~z$w_buff0~0_38 (ite .cse2 v_~z$w_buff1~0_29 v_~z~0_54)))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_48, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_96, ~z$w_buff0~0=v_~z$w_buff0~0_38, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$w_buff1~0=v_~z$w_buff1~0_29, ~z~0=v_~z~0_54} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_95, ~z$w_buff0~0=v_~z$w_buff0~0_38, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_49, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$w_buff1~0=v_~z$w_buff1~0_29, ~z~0=v_~z~0_53} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0] [2022-12-13 00:46:44,336 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [499] $Ultimate##0-->L807: Formula: (and (= v_~z$r_buff0_thd4~0_56 1) (= v_~z$r_buff0_thd4~0_57 v_~z$r_buff1_thd4~0_49) (= v_~z$w_buff0~0_149 v_~z$w_buff1~0_129) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_13| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_13|) (= v_~z$r_buff0_thd3~0_47 v_~z$r_buff1_thd3~0_53) (= v_~z$w_buff0_used~0_230 v_~z$w_buff1_used~0_206) (= v_~z$w_buff0_used~0_229 1) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_13| 0)) (= v_~z$w_buff0~0_148 2) (= v_~z$r_buff0_thd2~0_19 v_~z$r_buff1_thd2~0_23) (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_206 256) 0)) (not (= (mod v_~z$w_buff0_used~0_229 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_13|) (= |v_P3Thread1of1ForFork2_~arg#1.offset_7| |v_P3Thread1of1ForFork2_#in~arg#1.offset_7|) (= |v_P3Thread1of1ForFork2_#in~arg#1.base_7| |v_P3Thread1of1ForFork2_~arg#1.base_7|) (= v_~z$r_buff0_thd0~0_157 v_~z$r_buff1_thd0~0_156) (= v_~z$r_buff0_thd1~0_25 v_~z$r_buff1_thd1~0_21)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_157, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_230, ~z$w_buff0~0=v_~z$w_buff0~0_149, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_7|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_57, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_19} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_49, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_229, ~z$w_buff0~0=v_~z$w_buff0~0_148, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_53, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_206, ~z$w_buff1~0=v_~z$w_buff1~0_129, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_13|, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_13|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_157, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_7|, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_7|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_156, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_21, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_56, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_19} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0] [2022-12-13 00:46:44,511 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:46:44,512 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1153 [2022-12-13 00:46:44,512 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 76 transitions, 556 flow [2022-12-13 00:46:44,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 00:46:44,513 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:44,513 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:44,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:46:44,513 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:46:44,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:44,514 INFO L85 PathProgramCache]: Analyzing trace with hash 499521671, now seen corresponding path program 1 times [2022-12-13 00:46:44,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:44,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212403932] [2022-12-13 00:46:44,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:44,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:45,080 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 00:46:45,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:45,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212403932] [2022-12-13 00:46:45,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212403932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:45,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:45,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:46:45,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720969914] [2022-12-13 00:46:45,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:45,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:46:45,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:45,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:46:45,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:46:45,083 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2022-12-13 00:46:45,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 76 transitions, 556 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 00:46:45,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:45,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2022-12-13 00:46:45,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:47,663 INFO L130 PetriNetUnfolder]: 21966/33554 cut-off events. [2022-12-13 00:46:47,663 INFO L131 PetriNetUnfolder]: For 70378/71228 co-relation queries the response was YES. [2022-12-13 00:46:47,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104125 conditions, 33554 events. 21966/33554 cut-off events. For 70378/71228 co-relation queries the response was YES. Maximal size of possible extension queue 1997. Compared 250892 event pairs, 4136 based on Foata normal form. 785/27108 useless extension candidates. Maximal degree in co-relation 104101. Up to 19494 conditions per place. [2022-12-13 00:46:47,859 INFO L137 encePairwiseOnDemand]: 39/47 looper letters, 84 selfloop transitions, 17 changer transitions 0/122 dead transitions. [2022-12-13 00:46:47,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 122 transitions, 1034 flow [2022-12-13 00:46:47,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:46:47,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:46:47,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-12-13 00:46:47,860 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5904255319148937 [2022-12-13 00:46:47,860 INFO L175 Difference]: Start difference. First operand has 65 places, 76 transitions, 556 flow. Second operand 4 states and 111 transitions. [2022-12-13 00:46:47,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 122 transitions, 1034 flow [2022-12-13 00:46:48,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 122 transitions, 955 flow, removed 34 selfloop flow, removed 2 redundant places. [2022-12-13 00:46:48,005 INFO L231 Difference]: Finished difference. Result has 68 places, 82 transitions, 618 flow [2022-12-13 00:46:48,006 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=618, PETRI_PLACES=68, PETRI_TRANSITIONS=82} [2022-12-13 00:46:48,006 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -10 predicate places. [2022-12-13 00:46:48,006 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:48,006 INFO L89 Accepts]: Start accepts. Operand has 68 places, 82 transitions, 618 flow [2022-12-13 00:46:48,007 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:48,007 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:48,008 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 82 transitions, 618 flow [2022-12-13 00:46:48,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 82 transitions, 618 flow [2022-12-13 00:46:48,228 INFO L130 PetriNetUnfolder]: 714/2076 cut-off events. [2022-12-13 00:46:48,228 INFO L131 PetriNetUnfolder]: For 3876/4315 co-relation queries the response was YES. [2022-12-13 00:46:48,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6068 conditions, 2076 events. 714/2076 cut-off events. For 3876/4315 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 19671 event pairs, 161 based on Foata normal form. 4/1475 useless extension candidates. Maximal degree in co-relation 6045. Up to 849 conditions per place. [2022-12-13 00:46:48,249 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 82 transitions, 618 flow [2022-12-13 00:46:48,249 INFO L226 LiptonReduction]: Number of co-enabled transitions 1874 [2022-12-13 00:46:48,254 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:46:48,255 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 249 [2022-12-13 00:46:48,255 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 82 transitions, 618 flow [2022-12-13 00:46:48,255 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 00:46:48,255 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:48,255 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:48,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:46:48,256 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:46:48,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:48,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1004625512, now seen corresponding path program 1 times [2022-12-13 00:46:48,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:48,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157626878] [2022-12-13 00:46:48,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:48,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:48,730 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 00:46:48,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:48,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157626878] [2022-12-13 00:46:48,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157626878] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:48,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:48,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:46:48,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955539704] [2022-12-13 00:46:48,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:48,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:46:48,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:48,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:46:48,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:46:48,733 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2022-12-13 00:46:48,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 82 transitions, 618 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:48,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:48,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2022-12-13 00:46:48,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:51,866 INFO L130 PetriNetUnfolder]: 25373/38532 cut-off events. [2022-12-13 00:46:51,866 INFO L131 PetriNetUnfolder]: For 85929/87324 co-relation queries the response was YES. [2022-12-13 00:46:52,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122574 conditions, 38532 events. 25373/38532 cut-off events. For 85929/87324 co-relation queries the response was YES. Maximal size of possible extension queue 2485. Compared 292351 event pairs, 4628 based on Foata normal form. 762/30830 useless extension candidates. Maximal degree in co-relation 122548. Up to 19946 conditions per place. [2022-12-13 00:46:52,136 INFO L137 encePairwiseOnDemand]: 38/47 looper letters, 93 selfloop transitions, 29 changer transitions 0/143 dead transitions. [2022-12-13 00:46:52,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 143 transitions, 1218 flow [2022-12-13 00:46:52,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:46:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:46:52,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2022-12-13 00:46:52,139 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5617021276595745 [2022-12-13 00:46:52,139 INFO L175 Difference]: Start difference. First operand has 68 places, 82 transitions, 618 flow. Second operand 5 states and 132 transitions. [2022-12-13 00:46:52,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 143 transitions, 1218 flow [2022-12-13 00:46:52,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 143 transitions, 1183 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:46:52,211 INFO L231 Difference]: Finished difference. Result has 71 places, 94 transitions, 795 flow [2022-12-13 00:46:52,212 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=795, PETRI_PLACES=71, PETRI_TRANSITIONS=94} [2022-12-13 00:46:52,212 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -7 predicate places. [2022-12-13 00:46:52,212 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:52,212 INFO L89 Accepts]: Start accepts. Operand has 71 places, 94 transitions, 795 flow [2022-12-13 00:46:52,213 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:52,213 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:52,214 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 94 transitions, 795 flow [2022-12-13 00:46:52,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 94 transitions, 795 flow [2022-12-13 00:46:52,358 INFO L130 PetriNetUnfolder]: 853/2457 cut-off events. [2022-12-13 00:46:52,358 INFO L131 PetriNetUnfolder]: For 5137/5576 co-relation queries the response was YES. [2022-12-13 00:46:52,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7835 conditions, 2457 events. 853/2457 cut-off events. For 5137/5576 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 24031 event pairs, 161 based on Foata normal form. 4/1744 useless extension candidates. Maximal degree in co-relation 7811. Up to 1024 conditions per place. [2022-12-13 00:46:52,379 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 94 transitions, 795 flow [2022-12-13 00:46:52,379 INFO L226 LiptonReduction]: Number of co-enabled transitions 2134 [2022-12-13 00:46:52,386 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:46:52,387 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-13 00:46:52,387 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 94 transitions, 795 flow [2022-12-13 00:46:52,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:52,388 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:52,388 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:52,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:46:52,388 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:46:52,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:52,388 INFO L85 PathProgramCache]: Analyzing trace with hash -996207152, now seen corresponding path program 2 times [2022-12-13 00:46:52,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:52,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116847623] [2022-12-13 00:46:52,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:52,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:53,054 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 00:46:53,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:53,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116847623] [2022-12-13 00:46:53,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116847623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:53,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:53,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:46:53,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910858968] [2022-12-13 00:46:53,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:53,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:46:53,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:53,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:46:53,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:46:53,057 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2022-12-13 00:46:53,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 94 transitions, 795 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:53,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:53,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2022-12-13 00:46:53,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:56,334 INFO L130 PetriNetUnfolder]: 26411/40213 cut-off events. [2022-12-13 00:46:56,335 INFO L131 PetriNetUnfolder]: For 115185/116648 co-relation queries the response was YES. [2022-12-13 00:46:56,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138090 conditions, 40213 events. 26411/40213 cut-off events. For 115185/116648 co-relation queries the response was YES. Maximal size of possible extension queue 2669. Compared 310006 event pairs, 4763 based on Foata normal form. 764/32050 useless extension candidates. Maximal degree in co-relation 138063. Up to 25570 conditions per place. [2022-12-13 00:46:56,641 INFO L137 encePairwiseOnDemand]: 40/47 looper letters, 94 selfloop transitions, 23 changer transitions 0/138 dead transitions. [2022-12-13 00:46:56,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 138 transitions, 1321 flow [2022-12-13 00:46:56,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:46:56,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:46:56,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-12-13 00:46:56,780 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2022-12-13 00:46:56,781 INFO L175 Difference]: Start difference. First operand has 71 places, 94 transitions, 795 flow. Second operand 4 states and 108 transitions. [2022-12-13 00:46:56,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 138 transitions, 1321 flow [2022-12-13 00:46:56,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 138 transitions, 1291 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:46:56,932 INFO L231 Difference]: Finished difference. Result has 73 places, 100 transitions, 910 flow [2022-12-13 00:46:56,932 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=910, PETRI_PLACES=73, PETRI_TRANSITIONS=100} [2022-12-13 00:46:56,933 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -5 predicate places. [2022-12-13 00:46:56,933 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:56,933 INFO L89 Accepts]: Start accepts. Operand has 73 places, 100 transitions, 910 flow [2022-12-13 00:46:56,934 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:56,934 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:56,934 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 100 transitions, 910 flow [2022-12-13 00:46:56,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 100 transitions, 910 flow [2022-12-13 00:46:57,114 INFO L130 PetriNetUnfolder]: 920/2672 cut-off events. [2022-12-13 00:46:57,115 INFO L131 PetriNetUnfolder]: For 6156/6595 co-relation queries the response was YES. [2022-12-13 00:46:57,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8658 conditions, 2672 events. 920/2672 cut-off events. For 6156/6595 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 26767 event pairs, 177 based on Foata normal form. 4/1897 useless extension candidates. Maximal degree in co-relation 8633. Up to 1112 conditions per place. [2022-12-13 00:46:57,142 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 100 transitions, 910 flow [2022-12-13 00:46:57,142 INFO L226 LiptonReduction]: Number of co-enabled transitions 2256 [2022-12-13 00:46:57,149 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:46:57,150 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-13 00:46:57,150 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 100 transitions, 910 flow [2022-12-13 00:46:57,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:57,150 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:57,150 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:57,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:46:57,150 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:46:57,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:57,152 INFO L85 PathProgramCache]: Analyzing trace with hash -995992849, now seen corresponding path program 1 times [2022-12-13 00:46:57,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:57,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346101448] [2022-12-13 00:46:57,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:57,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:57,629 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 00:46:57,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:57,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346101448] [2022-12-13 00:46:57,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346101448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:57,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:57,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:46:57,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458854807] [2022-12-13 00:46:57,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:57,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:46:57,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:57,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:46:57,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:46:57,631 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2022-12-13 00:46:57,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 100 transitions, 910 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:57,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:57,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2022-12-13 00:46:57,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:01,476 INFO L130 PetriNetUnfolder]: 28395/43583 cut-off events. [2022-12-13 00:47:01,476 INFO L131 PetriNetUnfolder]: For 143608/144969 co-relation queries the response was YES. [2022-12-13 00:47:01,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152475 conditions, 43583 events. 28395/43583 cut-off events. For 143608/144969 co-relation queries the response was YES. Maximal size of possible extension queue 2924. Compared 343261 event pairs, 5088 based on Foata normal form. 766/34734 useless extension candidates. Maximal degree in co-relation 152447. Up to 19708 conditions per place. [2022-12-13 00:47:01,790 INFO L137 encePairwiseOnDemand]: 38/47 looper letters, 103 selfloop transitions, 44 changer transitions 0/168 dead transitions. [2022-12-13 00:47:01,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 168 transitions, 1646 flow [2022-12-13 00:47:01,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:47:01,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:47:01,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2022-12-13 00:47:01,792 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5787234042553191 [2022-12-13 00:47:01,792 INFO L175 Difference]: Start difference. First operand has 73 places, 100 transitions, 910 flow. Second operand 5 states and 136 transitions. [2022-12-13 00:47:01,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 168 transitions, 1646 flow [2022-12-13 00:47:02,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 168 transitions, 1615 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:47:02,005 INFO L231 Difference]: Finished difference. Result has 77 places, 112 transitions, 1172 flow [2022-12-13 00:47:02,006 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=879, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1172, PETRI_PLACES=77, PETRI_TRANSITIONS=112} [2022-12-13 00:47:02,007 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -1 predicate places. [2022-12-13 00:47:02,007 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:02,007 INFO L89 Accepts]: Start accepts. Operand has 77 places, 112 transitions, 1172 flow [2022-12-13 00:47:02,008 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:02,008 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:02,009 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 112 transitions, 1172 flow [2022-12-13 00:47:02,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 112 transitions, 1172 flow [2022-12-13 00:47:02,213 INFO L130 PetriNetUnfolder]: 1055/3067 cut-off events. [2022-12-13 00:47:02,213 INFO L131 PetriNetUnfolder]: For 9573/9974 co-relation queries the response was YES. [2022-12-13 00:47:02,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10940 conditions, 3067 events. 1055/3067 cut-off events. For 9573/9974 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 31388 event pairs, 151 based on Foata normal form. 4/2178 useless extension candidates. Maximal degree in co-relation 10913. Up to 1276 conditions per place. [2022-12-13 00:47:02,243 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 112 transitions, 1172 flow [2022-12-13 00:47:02,243 INFO L226 LiptonReduction]: Number of co-enabled transitions 2540 [2022-12-13 00:47:02,251 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:47:02,251 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 244 [2022-12-13 00:47:02,252 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 112 transitions, 1172 flow [2022-12-13 00:47:02,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:02,252 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:02,252 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:02,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:47:02,252 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:47:02,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:02,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1079748390, now seen corresponding path program 1 times [2022-12-13 00:47:02,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:02,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706578478] [2022-12-13 00:47:02,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:02,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:02,385 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 00:47:02,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:02,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706578478] [2022-12-13 00:47:02,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706578478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:02,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:02,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:47:02,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531509095] [2022-12-13 00:47:02,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:02,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:47:02,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:02,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:47:02,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:47:02,386 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2022-12-13 00:47:02,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 112 transitions, 1172 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:02,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:02,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2022-12-13 00:47:02,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:08,083 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L780-->L787: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_79 256) 0)) .cse2))) (and (= v_~z$r_buff0_thd3~0_25 (ite .cse0 0 v_~z$r_buff0_thd3~0_26)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_79) v_~z$w_buff1_used~0_78) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_78 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_25 256) 0)))) 0 v_~z$r_buff1_thd3~0_24) v_~z$r_buff1_thd3~0_23) (= (ite .cse4 0 v_~z$w_buff0_used~0_92) v_~z$w_buff0_used~0_91) (= v_~z~0_49 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse1 v_~z$w_buff1~0_27 v_~z~0_50)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_26, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_50} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][149], [P2Thread1of1ForFork0InUse, Black: 194#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 191#true, P1Thread1of1ForFork3InUse, 233#true, P0Thread1of1ForFork1InUse, 243#true, 157#true, P3Thread1of1ForFork2InUse, Black: 200#(and (= ~z$w_buff1~0 ~z~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 211#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff1_thd0~0 0)), Black: 213#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 180#true, Black: 220#(and (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 2))), Black: 221#(and (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 2)) (not (= 2 ~z~0))), 99#L787true, 193#(= ~y~0 1), 122#L750true, Black: 229#(and (= ~z~0 1) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 238#(and (not (= ~z$w_buff1~0 2)) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), 17#L852true, Black: 237#(and (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 2)) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0)), 143#true, Black: 183#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 182#(= ~x~0 0), Black: 189#(= ~y~0 0)]) [2022-12-13 00:47:08,084 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 00:47:08,084 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 00:47:08,084 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:47:08,084 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 00:47:08,084 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L780-->L787: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_79 256) 0)) .cse2))) (and (= v_~z$r_buff0_thd3~0_25 (ite .cse0 0 v_~z$r_buff0_thd3~0_26)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_79) v_~z$w_buff1_used~0_78) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_78 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_25 256) 0)))) 0 v_~z$r_buff1_thd3~0_24) v_~z$r_buff1_thd3~0_23) (= (ite .cse4 0 v_~z$w_buff0_used~0_92) v_~z$w_buff0_used~0_91) (= v_~z~0_49 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse1 v_~z$w_buff1~0_27 v_~z~0_50)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_26, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_50} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][149], [P2Thread1of1ForFork0InUse, Black: 194#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 191#true, P1Thread1of1ForFork3InUse, 233#true, P0Thread1of1ForFork1InUse, 243#true, P3Thread1of1ForFork2InUse, Black: 200#(and (= ~z$w_buff1~0 ~z~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 211#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff1_thd0~0 0)), Black: 213#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 180#true, 82#P3EXITtrue, Black: 220#(and (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 2))), Black: 221#(and (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 2)) (not (= 2 ~z~0))), 99#L787true, 193#(= ~y~0 1), 122#L750true, Black: 229#(and (= ~z~0 1) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 238#(and (not (= ~z$w_buff1~0 2)) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), 17#L852true, Black: 237#(and (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 2)) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0)), 143#true, Black: 183#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 182#(= ~x~0 0), Black: 189#(= ~y~0 0)]) [2022-12-13 00:47:08,084 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 00:47:08,084 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 00:47:08,084 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:47:08,084 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 00:47:08,085 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L780-->L787: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_79 256) 0)) .cse2))) (and (= v_~z$r_buff0_thd3~0_25 (ite .cse0 0 v_~z$r_buff0_thd3~0_26)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_79) v_~z$w_buff1_used~0_78) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_78 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_25 256) 0)))) 0 v_~z$r_buff1_thd3~0_24) v_~z$r_buff1_thd3~0_23) (= (ite .cse4 0 v_~z$w_buff0_used~0_92) v_~z$w_buff0_used~0_91) (= v_~z~0_49 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse1 v_~z$w_buff1~0_27 v_~z~0_50)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_26, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_50} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][149], [P2Thread1of1ForFork0InUse, Black: 194#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), 161#true, Black: 191#true, P1Thread1of1ForFork3InUse, 233#true, P0Thread1of1ForFork1InUse, 243#true, P3Thread1of1ForFork2InUse, Black: 200#(and (= ~z$w_buff1~0 ~z~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 211#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff1_thd0~0 0)), Black: 213#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 180#true, Black: 220#(and (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 2))), Black: 221#(and (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 2)) (not (= 2 ~z~0))), 99#L787true, 193#(= ~y~0 1), 122#L750true, Black: 229#(and (= ~z~0 1) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 238#(and (not (= ~z$w_buff1~0 2)) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), 17#L852true, Black: 237#(and (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 2)) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0)), 143#true, Black: 183#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 182#(= ~x~0 0), Black: 189#(= ~y~0 0)]) [2022-12-13 00:47:08,085 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 00:47:08,085 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 00:47:08,085 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 00:47:08,085 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:47:08,089 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L780-->L787: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_79 256) 0)) .cse2))) (and (= v_~z$r_buff0_thd3~0_25 (ite .cse0 0 v_~z$r_buff0_thd3~0_26)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_79) v_~z$w_buff1_used~0_78) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_78 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_25 256) 0)))) 0 v_~z$r_buff1_thd3~0_24) v_~z$r_buff1_thd3~0_23) (= (ite .cse4 0 v_~z$w_buff0_used~0_92) v_~z$w_buff0_used~0_91) (= v_~z~0_49 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse1 v_~z$w_buff1~0_27 v_~z~0_50)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_26, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_50} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][149], [P2Thread1of1ForFork0InUse, Black: 194#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 191#true, P1Thread1of1ForFork3InUse, 233#true, P0Thread1of1ForFork1InUse, 243#true, 157#true, P3Thread1of1ForFork2InUse, Black: 200#(and (= ~z$w_buff1~0 ~z~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 211#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff1_thd0~0 0)), Black: 213#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 180#true, 142#true, Black: 220#(and (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 2))), Black: 221#(and (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 2)) (not (= 2 ~z~0))), 99#L787true, 193#(= ~y~0 1), 122#L750true, Black: 229#(and (= ~z~0 1) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 238#(and (not (= ~z$w_buff1~0 2)) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), 17#L852true, Black: 237#(and (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 2)) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0)), Black: 183#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 182#(= ~x~0 0), Black: 189#(= ~y~0 0)]) [2022-12-13 00:47:08,089 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 00:47:08,089 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 00:47:08,089 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 00:47:08,089 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:47:08,089 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L780-->L787: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_79 256) 0)) .cse2))) (and (= v_~z$r_buff0_thd3~0_25 (ite .cse0 0 v_~z$r_buff0_thd3~0_26)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_79) v_~z$w_buff1_used~0_78) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_78 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_25 256) 0)))) 0 v_~z$r_buff1_thd3~0_24) v_~z$r_buff1_thd3~0_23) (= (ite .cse4 0 v_~z$w_buff0_used~0_92) v_~z$w_buff0_used~0_91) (= v_~z~0_49 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse1 v_~z$w_buff1~0_27 v_~z~0_50)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_26, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_50} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][149], [P2Thread1of1ForFork0InUse, Black: 194#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 191#true, P1Thread1of1ForFork3InUse, 233#true, P0Thread1of1ForFork1InUse, 243#true, P3Thread1of1ForFork2InUse, Black: 200#(and (= ~z$w_buff1~0 ~z~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 211#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff1_thd0~0 0)), Black: 213#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 180#true, 82#P3EXITtrue, 142#true, Black: 220#(and (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 2))), Black: 221#(and (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 2)) (not (= 2 ~z~0))), 99#L787true, 193#(= ~y~0 1), 122#L750true, Black: 229#(and (= ~z~0 1) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 238#(and (not (= ~z$w_buff1~0 2)) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), 17#L852true, Black: 237#(and (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 2)) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0)), Black: 183#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 182#(= ~x~0 0), Black: 189#(= ~y~0 0)]) [2022-12-13 00:47:08,089 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 00:47:08,090 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 00:47:08,090 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 00:47:08,090 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:47:08,090 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L780-->L787: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_79 256) 0)) .cse2))) (and (= v_~z$r_buff0_thd3~0_25 (ite .cse0 0 v_~z$r_buff0_thd3~0_26)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_79) v_~z$w_buff1_used~0_78) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_78 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_25 256) 0)))) 0 v_~z$r_buff1_thd3~0_24) v_~z$r_buff1_thd3~0_23) (= (ite .cse4 0 v_~z$w_buff0_used~0_92) v_~z$w_buff0_used~0_91) (= v_~z~0_49 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse1 v_~z$w_buff1~0_27 v_~z~0_50)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_26, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_50} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][149], [Black: 194#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), P2Thread1of1ForFork0InUse, 161#true, Black: 191#true, P1Thread1of1ForFork3InUse, 233#true, P0Thread1of1ForFork1InUse, 243#true, P3Thread1of1ForFork2InUse, Black: 200#(and (= ~z$w_buff1~0 ~z~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 211#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff1_thd0~0 0)), Black: 213#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 180#true, 142#true, Black: 220#(and (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 2))), Black: 221#(and (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 2)) (not (= 2 ~z~0))), 99#L787true, 193#(= ~y~0 1), 122#L750true, Black: 229#(and (= ~z~0 1) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 238#(and (not (= ~z$w_buff1~0 2)) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), 17#L852true, Black: 237#(and (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 2)) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0)), Black: 183#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 182#(= ~x~0 0), Black: 189#(= ~y~0 0)]) [2022-12-13 00:47:08,090 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 00:47:08,091 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 00:47:08,091 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 00:47:08,091 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:47:08,094 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L780-->L787: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_79 256) 0)) .cse2))) (and (= v_~z$r_buff0_thd3~0_25 (ite .cse0 0 v_~z$r_buff0_thd3~0_26)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_79) v_~z$w_buff1_used~0_78) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_78 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_25 256) 0)))) 0 v_~z$r_buff1_thd3~0_24) v_~z$r_buff1_thd3~0_23) (= (ite .cse4 0 v_~z$w_buff0_used~0_92) v_~z$w_buff0_used~0_91) (= v_~z~0_49 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse1 v_~z$w_buff1~0_27 v_~z~0_50)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_26, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_50} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][149], [P2Thread1of1ForFork0InUse, Black: 194#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 191#true, P1Thread1of1ForFork3InUse, 233#true, P0Thread1of1ForFork1InUse, 157#true, 243#true, P3Thread1of1ForFork2InUse, Black: 200#(and (= ~z$w_buff1~0 ~z~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 95#P1EXITtrue, Black: 211#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff1_thd0~0 0)), Black: 213#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 180#true, Black: 220#(and (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 2))), Black: 221#(and (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 2)) (not (= 2 ~z~0))), 99#L787true, 193#(= ~y~0 1), 122#L750true, Black: 229#(and (= ~z~0 1) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 238#(and (not (= ~z$w_buff1~0 2)) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), 17#L852true, Black: 237#(and (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 2)) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0)), Black: 183#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 182#(= ~x~0 0), Black: 189#(= ~y~0 0)]) [2022-12-13 00:47:08,094 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 00:47:08,094 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 00:47:08,094 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:47:08,094 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 00:47:08,095 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L780-->L787: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_79 256) 0)) .cse2))) (and (= v_~z$r_buff0_thd3~0_25 (ite .cse0 0 v_~z$r_buff0_thd3~0_26)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_79) v_~z$w_buff1_used~0_78) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_78 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_25 256) 0)))) 0 v_~z$r_buff1_thd3~0_24) v_~z$r_buff1_thd3~0_23) (= (ite .cse4 0 v_~z$w_buff0_used~0_92) v_~z$w_buff0_used~0_91) (= v_~z~0_49 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse1 v_~z$w_buff1~0_27 v_~z~0_50)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_26, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_50} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][149], [Black: 194#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), P2Thread1of1ForFork0InUse, Black: 191#true, P1Thread1of1ForFork3InUse, 233#true, P0Thread1of1ForFork1InUse, 243#true, P3Thread1of1ForFork2InUse, Black: 200#(and (= ~z$w_buff1~0 ~z~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 95#P1EXITtrue, Black: 211#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff1_thd0~0 0)), Black: 213#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 180#true, 82#P3EXITtrue, Black: 220#(and (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 2))), Black: 221#(and (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 2)) (not (= 2 ~z~0))), 99#L787true, 193#(= ~y~0 1), 122#L750true, Black: 229#(and (= ~z~0 1) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 238#(and (not (= ~z$w_buff1~0 2)) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), 17#L852true, Black: 237#(and (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 2)) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0)), Black: 183#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 182#(= ~x~0 0), Black: 189#(= ~y~0 0)]) [2022-12-13 00:47:08,095 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 00:47:08,095 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 00:47:08,095 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 00:47:08,095 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:47:08,096 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([363] L780-->L787: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff1_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_79 256) 0)) .cse2))) (and (= v_~z$r_buff0_thd3~0_25 (ite .cse0 0 v_~z$r_buff0_thd3~0_26)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_79) v_~z$w_buff1_used~0_78) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_78 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_25 256) 0)))) 0 v_~z$r_buff1_thd3~0_24) v_~z$r_buff1_thd3~0_23) (= (ite .cse4 0 v_~z$w_buff0_used~0_92) v_~z$w_buff0_used~0_91) (= v_~z~0_49 (ite .cse4 v_~z$w_buff0~0_36 (ite .cse1 v_~z$w_buff1~0_27 v_~z~0_50)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_26, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_50} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][149], [Black: 194#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), P2Thread1of1ForFork0InUse, 161#true, Black: 191#true, P1Thread1of1ForFork3InUse, 233#true, P0Thread1of1ForFork1InUse, 243#true, P3Thread1of1ForFork2InUse, Black: 200#(and (= ~z$w_buff1~0 ~z~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 95#P1EXITtrue, Black: 211#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff1_thd0~0 0)), Black: 213#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 180#true, Black: 220#(and (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 2))), Black: 221#(and (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 2)) (not (= 2 ~z~0))), 99#L787true, 193#(= ~y~0 1), 122#L750true, Black: 229#(and (= ~z~0 1) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 238#(and (not (= ~z$w_buff1~0 2)) (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0))), 17#L852true, Black: 237#(and (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 2)) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0)), Black: 183#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)))), Black: 182#(= ~x~0 0), Black: 189#(= ~y~0 0)]) [2022-12-13 00:47:08,096 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 00:47:08,096 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 00:47:08,096 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 00:47:08,096 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 00:47:09,525 INFO L130 PetriNetUnfolder]: 56115/79068 cut-off events. [2022-12-13 00:47:09,525 INFO L131 PetriNetUnfolder]: For 360980/364806 co-relation queries the response was YES. [2022-12-13 00:47:09,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297720 conditions, 79068 events. 56115/79068 cut-off events. For 360980/364806 co-relation queries the response was YES. Maximal size of possible extension queue 5253. Compared 581239 event pairs, 17770 based on Foata normal form. 1248/50393 useless extension candidates. Maximal degree in co-relation 297690. Up to 75082 conditions per place. [2022-12-13 00:47:10,111 INFO L137 encePairwiseOnDemand]: 33/47 looper letters, 134 selfloop transitions, 13 changer transitions 5/170 dead transitions. [2022-12-13 00:47:10,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 170 transitions, 2070 flow [2022-12-13 00:47:10,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:47:10,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:47:10,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2022-12-13 00:47:10,113 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6808510638297872 [2022-12-13 00:47:10,113 INFO L175 Difference]: Start difference. First operand has 77 places, 112 transitions, 1172 flow. Second operand 3 states and 96 transitions. [2022-12-13 00:47:10,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 170 transitions, 2070 flow [2022-12-13 00:47:10,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 170 transitions, 2010 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 00:47:10,777 INFO L231 Difference]: Finished difference. Result has 78 places, 118 transitions, 1147 flow [2022-12-13 00:47:10,777 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1147, PETRI_PLACES=78, PETRI_TRANSITIONS=118} [2022-12-13 00:47:10,777 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, 0 predicate places. [2022-12-13 00:47:10,777 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:10,777 INFO L89 Accepts]: Start accepts. Operand has 78 places, 118 transitions, 1147 flow [2022-12-13 00:47:10,778 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:10,779 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:10,779 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 118 transitions, 1147 flow [2022-12-13 00:47:10,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 118 transitions, 1147 flow [2022-12-13 00:47:13,958 INFO L130 PetriNetUnfolder]: 26809/43173 cut-off events. [2022-12-13 00:47:13,959 INFO L131 PetriNetUnfolder]: For 61815/66047 co-relation queries the response was YES. [2022-12-13 00:47:14,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119416 conditions, 43173 events. 26809/43173 cut-off events. For 61815/66047 co-relation queries the response was YES. Maximal size of possible extension queue 5784. Compared 417041 event pairs, 12436 based on Foata normal form. 574/21462 useless extension candidates. Maximal degree in co-relation 119388. Up to 32686 conditions per place. [2022-12-13 00:47:14,414 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 118 transitions, 1147 flow [2022-12-13 00:47:14,414 INFO L226 LiptonReduction]: Number of co-enabled transitions 3222 [2022-12-13 00:47:14,808 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:47:14,809 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4032 [2022-12-13 00:47:14,809 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 118 transitions, 1147 flow [2022-12-13 00:47:14,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:14,809 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:14,809 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 00:47:14,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:47:14,810 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:47:14,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:14,810 INFO L85 PathProgramCache]: Analyzing trace with hash -509595150, now seen corresponding path program 1 times [2022-12-13 00:47:14,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:14,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394564222] [2022-12-13 00:47:14,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:14,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:15,033 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 00:47:15,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:15,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394564222] [2022-12-13 00:47:15,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394564222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:15,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:15,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:47:15,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893762769] [2022-12-13 00:47:15,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:15,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:47:15,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:15,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:47:15,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:47:15,037 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2022-12-13 00:47:15,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 118 transitions, 1147 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:15,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:15,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2022-12-13 00:47:15,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:19,879 INFO L130 PetriNetUnfolder]: 36357/53622 cut-off events. [2022-12-13 00:47:19,879 INFO L131 PetriNetUnfolder]: For 216282/219028 co-relation queries the response was YES. [2022-12-13 00:47:20,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227060 conditions, 53622 events. 36357/53622 cut-off events. For 216282/219028 co-relation queries the response was YES. Maximal size of possible extension queue 3882. Compared 410735 event pairs, 5371 based on Foata normal form. 1646/35660 useless extension candidates. Maximal degree in co-relation 227029. Up to 47098 conditions per place. [2022-12-13 00:47:20,246 INFO L137 encePairwiseOnDemand]: 32/46 looper letters, 168 selfloop transitions, 25 changer transitions 6/217 dead transitions. [2022-12-13 00:47:20,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 217 transitions, 2622 flow [2022-12-13 00:47:20,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:47:20,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:47:20,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2022-12-13 00:47:20,254 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.717391304347826 [2022-12-13 00:47:20,254 INFO L175 Difference]: Start difference. First operand has 78 places, 118 transitions, 1147 flow. Second operand 4 states and 132 transitions. [2022-12-13 00:47:20,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 217 transitions, 2622 flow [2022-12-13 00:47:20,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 217 transitions, 2609 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:47:20,619 INFO L231 Difference]: Finished difference. Result has 81 places, 124 transitions, 1188 flow [2022-12-13 00:47:20,619 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1055, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1188, PETRI_PLACES=81, PETRI_TRANSITIONS=124} [2022-12-13 00:47:20,619 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, 3 predicate places. [2022-12-13 00:47:20,620 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:20,620 INFO L89 Accepts]: Start accepts. Operand has 81 places, 124 transitions, 1188 flow [2022-12-13 00:47:20,621 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:20,621 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:20,621 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 124 transitions, 1188 flow [2022-12-13 00:47:20,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 124 transitions, 1188 flow [2022-12-13 00:47:22,792 INFO L130 PetriNetUnfolder]: 16930/29289 cut-off events. [2022-12-13 00:47:22,792 INFO L131 PetriNetUnfolder]: For 50394/74732 co-relation queries the response was YES. [2022-12-13 00:47:22,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107025 conditions, 29289 events. 16930/29289 cut-off events. For 50394/74732 co-relation queries the response was YES. Maximal size of possible extension queue 4260. Compared 290678 event pairs, 3988 based on Foata normal form. 512/15832 useless extension candidates. Maximal degree in co-relation 106995. Up to 21622 conditions per place. [2022-12-13 00:47:23,106 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 124 transitions, 1188 flow [2022-12-13 00:47:23,106 INFO L226 LiptonReduction]: Number of co-enabled transitions 3624 [2022-12-13 00:47:23,427 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [437] L841-3-->L846: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| 0)) (= (mod v_~main$tmp_guard0~0_48 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_231 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_48)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_231} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_39|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_231, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_48, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [532] L777-->L852: Formula: (let ((.cse3 (not (= 0 (mod v_~z$r_buff1_thd0~0_341 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_339 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_451 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse0 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_415 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_452 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_415) v_~z$w_buff1_used~0_414) (= v_~z$r_buff1_thd0~0_340 (ite (or (and .cse2 (not (= (mod v_~z$r_buff0_thd0~0_338 256) 0))) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_414 256) 0)))) 0 v_~z$r_buff1_thd0~0_341)) (= v_~z$r_buff0_thd0~0_338 (ite .cse1 0 v_~z$r_buff0_thd0~0_339)) (= v_~z~0_381 (ite .cse4 v_~z$w_buff0~0_334 (ite .cse0 v_~z$w_buff1~0_304 1))) (= (ite .cse4 0 v_~z$w_buff0_used~0_452) v_~z$w_buff0_used~0_451)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_339, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_452, ~z$w_buff0~0=v_~z$w_buff0~0_334, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_341, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_415, ~z$w_buff1~0=v_~z$w_buff1~0_304} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_338, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_451, ~z$w_buff0~0=v_~z$w_buff0~0_334, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_340, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_414, ~z$w_buff1~0=v_~z$w_buff1~0_304, ~z~0=v_~z~0_381} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0] [2022-12-13 00:47:23,762 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [437] L841-3-->L846: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| 0)) (= (mod v_~main$tmp_guard0~0_48 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_231 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_48)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_231} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_39|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_231, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_48, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [536] L777-->L852: Formula: (let ((.cse1 (not (= (mod v_~z$r_buff1_thd0~0_351 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_467 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_349 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_468 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff1_used~0_429 256) 0)) .cse1))) (and (= v_~z$w_buff0_used~0_467 (ite .cse0 0 v_~z$w_buff0_used~0_468)) (= v_~z$r_buff1_thd0~0_350 (ite (or (and .cse1 (not (= (mod v_~z$w_buff1_used~0_428 256) 0))) (and .cse2 (not (= (mod v_~z$r_buff0_thd0~0_348 256) 0)))) 0 v_~z$r_buff1_thd0~0_351)) (= v_~z$w_buff1_used~0_428 (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_429)) (= v_~z$r_buff0_thd0~0_348 (ite .cse3 0 v_~z$r_buff0_thd0~0_349)) (= (ite .cse0 v_~z$w_buff0~0_344 (ite .cse4 v_~z$w_buff1~0_312 1)) v_~z~0_395)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_349, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_468, ~z$w_buff0~0=v_~z$w_buff0~0_344, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_351, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_429, ~z$w_buff1~0=v_~z$w_buff1~0_312} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_348, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_467, ~z$w_buff0~0=v_~z$w_buff0~0_344, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_350, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_428, ~z$w_buff1~0=v_~z$w_buff1~0_312, ~z~0=v_~z~0_395} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0] [2022-12-13 00:47:24,299 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:47:24,299 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3679 [2022-12-13 00:47:24,300 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 124 transitions, 1204 flow [2022-12-13 00:47:24,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:24,300 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:24,300 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:24,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:47:24,300 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:47:24,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:24,300 INFO L85 PathProgramCache]: Analyzing trace with hash -715908582, now seen corresponding path program 1 times [2022-12-13 00:47:24,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:24,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684403065] [2022-12-13 00:47:24,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:24,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:24,895 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 00:47:24,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:24,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684403065] [2022-12-13 00:47:24,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684403065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:24,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:24,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:47:24,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661564814] [2022-12-13 00:47:24,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:24,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:47:24,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:24,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:47:24,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:47:24,896 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2022-12-13 00:47:24,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 124 transitions, 1204 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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 00:47:24,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:24,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2022-12-13 00:47:24,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand