/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-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 16:30:25,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 16:30:25,486 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 16:30:25,519 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 16:30:25,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 16:30:25,520 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 16:30:25,521 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 16:30:25,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 16:30:25,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 16:30:25,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 16:30:25,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 16:30:25,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 16:30:25,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 16:30:25,526 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 16:30:25,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 16:30:25,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 16:30:25,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 16:30:25,529 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 16:30:25,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 16:30:25,531 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 16:30:25,532 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 16:30:25,533 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 16:30:25,534 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 16:30:25,535 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 16:30:25,537 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 16:30:25,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 16:30:25,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 16:30:25,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 16:30:25,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 16:30:25,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 16:30:25,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 16:30:25,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 16:30:25,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 16:30:25,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 16:30:25,541 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 16:30:25,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 16:30:25,542 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 16:30:25,542 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 16:30:25,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 16:30:25,543 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 16:30:25,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 16:30:25,545 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-NoLbe.epf [2022-12-06 16:30:25,561 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 16:30:25,561 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 16:30:25,562 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 16:30:25,562 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 16:30:25,563 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 16:30:25,563 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 16:30:25,563 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 16:30:25,563 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 16:30:25,563 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 16:30:25,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 16:30:25,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 16:30:25,564 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 16:30:25,564 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 16:30:25,564 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 16:30:25,564 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 16:30:25,564 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 16:30:25,564 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 16:30:25,564 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 16:30:25,564 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 16:30:25,565 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 16:30:25,565 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 16:30:25,565 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 16:30:25,565 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 16:30:25,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:30:25,565 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 16:30:25,565 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 16:30:25,565 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 16:30:25,566 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 16:30:25,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 16:30:25,566 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 16:30:25,566 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 16:30:25,566 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 16:30:25,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 16:30:25,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 16:30:25,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 16:30:25,831 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 16:30:25,831 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 16:30:25,833 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-06 16:30:26,796 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 16:30:27,077 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 16:30:27,078 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-06 16:30:27,086 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f20f1cb67/a6c341f34e1240fa8130ea33c382374a/FLAG5dc164664 [2022-12-06 16:30:27,095 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f20f1cb67/a6c341f34e1240fa8130ea33c382374a [2022-12-06 16:30:27,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 16:30:27,098 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 16:30:27,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 16:30:27,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 16:30:27,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 16:30:27,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:30:27" (1/1) ... [2022-12-06 16:30:27,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fa5e29d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:27, skipping insertion in model container [2022-12-06 16:30:27,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:30:27" (1/1) ... [2022-12-06 16:30:27,108 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 16:30:27,161 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 16:30:27,258 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/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-06 16:30:27,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:30:27,416 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 16:30:27,426 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/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-06 16:30:27,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:30:27,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:30:27,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:30:27,514 INFO L208 MainTranslator]: Completed translation [2022-12-06 16:30:27,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:27 WrapperNode [2022-12-06 16:30:27,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 16:30:27,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 16:30:27,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 16:30:27,517 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 16:30:27,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:27" (1/1) ... [2022-12-06 16:30:27,546 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:27" (1/1) ... [2022-12-06 16:30:27,575 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2022-12-06 16:30:27,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 16:30:27,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 16:30:27,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 16:30:27,577 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 16:30:27,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:27" (1/1) ... [2022-12-06 16:30:27,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:27" (1/1) ... [2022-12-06 16:30:27,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:27" (1/1) ... [2022-12-06 16:30:27,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:27" (1/1) ... [2022-12-06 16:30:27,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:27" (1/1) ... [2022-12-06 16:30:27,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:27" (1/1) ... [2022-12-06 16:30:27,604 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:27" (1/1) ... [2022-12-06 16:30:27,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:27" (1/1) ... [2022-12-06 16:30:27,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 16:30:27,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 16:30:27,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 16:30:27,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 16:30:27,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:27" (1/1) ... [2022-12-06 16:30:27,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:30:27,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:30:27,644 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 16:30:27,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 16:30:27,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 16:30:27,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 16:30:27,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 16:30:27,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 16:30:27,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 16:30:27,673 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 16:30:27,673 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 16:30:27,673 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 16:30:27,674 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 16:30:27,674 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 16:30:27,674 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 16:30:27,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 16:30:27,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 16:30:27,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 16:30:27,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 16:30:27,675 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 16:30:27,816 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 16:30:27,817 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 16:30:28,098 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 16:30:28,195 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 16:30:28,195 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 16:30:28,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:30:28 BoogieIcfgContainer [2022-12-06 16:30:28,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 16:30:28,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 16:30:28,198 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 16:30:28,200 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 16:30:28,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:30:27" (1/3) ... [2022-12-06 16:30:28,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@672f0626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:30:28, skipping insertion in model container [2022-12-06 16:30:28,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:27" (2/3) ... [2022-12-06 16:30:28,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@672f0626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:30:28, skipping insertion in model container [2022-12-06 16:30:28,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:30:28" (3/3) ... [2022-12-06 16:30:28,202 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-06 16:30:28,218 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 16:30:28,219 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 16:30:28,220 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 16:30:28,270 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 16:30:28,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2022-12-06 16:30:28,352 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-06 16:30:28,353 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:30:28,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-06 16:30:28,359 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 235 flow [2022-12-06 16:30:28,362 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2022-12-06 16:30:28,371 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 16:30:28,376 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=PETRI_NET, 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;@1c3111b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 16:30:28,377 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 16:30:28,397 INFO L130 PetriNetUnfolder]: 0/70 cut-off events. [2022-12-06 16:30:28,397 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:30:28,397 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:30:28,398 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:30:28,398 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:30:28,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:30:28,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1367498785, now seen corresponding path program 1 times [2022-12-06 16:30:28,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:30:28,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879579217] [2022-12-06 16:30:28,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:30:28,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:30:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:30:28,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:30:28,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:30:28,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879579217] [2022-12-06 16:30:28,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879579217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:30:28,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:30:28,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 16:30:28,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867215430] [2022-12-06 16:30:28,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:30:28,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 16:30:28,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:30:28,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 16:30:28,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 16:30:28,984 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 110 [2022-12-06 16:30:28,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 107 transitions, 223 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:28,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:30:28,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 110 [2022-12-06 16:30:28,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:30:29,078 INFO L130 PetriNetUnfolder]: 17/184 cut-off events. [2022-12-06 16:30:29,079 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 16:30:29,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 184 events. 17/184 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 480 event pairs, 3 based on Foata normal form. 9/186 useless extension candidates. Maximal degree in co-relation 186. Up to 27 conditions per place. [2022-12-06 16:30:29,082 INFO L137 encePairwiseOnDemand]: 105/110 looper letters, 10 selfloop transitions, 2 changer transitions 0/106 dead transitions. [2022-12-06 16:30:29,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 106 transitions, 245 flow [2022-12-06 16:30:29,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 16:30:29,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 16:30:29,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2022-12-06 16:30:29,094 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2022-12-06 16:30:29,098 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 0 predicate places. [2022-12-06 16:30:29,099 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 106 transitions, 245 flow [2022-12-06 16:30:29,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:29,099 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:30:29,099 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:30:29,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 16:30:29,100 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:30:29,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:30:29,100 INFO L85 PathProgramCache]: Analyzing trace with hash 405999513, now seen corresponding path program 1 times [2022-12-06 16:30:29,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:30:29,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131254487] [2022-12-06 16:30:29,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:30:29,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:30:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:30:30,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:30:30,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:30:30,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131254487] [2022-12-06 16:30:30,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131254487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:30:30,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:30:30,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:30:30,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311643028] [2022-12-06 16:30:30,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:30:30,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:30:30,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:30:30,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:30:30,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:30:30,016 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 110 [2022-12-06 16:30:30,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 106 transitions, 245 flow. Second operand has 7 states, 7 states have (on average 79.85714285714286) internal successors, (559), 7 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:30,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:30:30,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 110 [2022-12-06 16:30:30,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:30:30,715 INFO L130 PetriNetUnfolder]: 995/2645 cut-off events. [2022-12-06 16:30:30,715 INFO L131 PetriNetUnfolder]: For 350/525 co-relation queries the response was YES. [2022-12-06 16:30:30,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4744 conditions, 2645 events. 995/2645 cut-off events. For 350/525 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 21080 event pairs, 136 based on Foata normal form. 2/2579 useless extension candidates. Maximal degree in co-relation 4681. Up to 581 conditions per place. [2022-12-06 16:30:30,728 INFO L137 encePairwiseOnDemand]: 98/110 looper letters, 37 selfloop transitions, 8 changer transitions 80/190 dead transitions. [2022-12-06 16:30:30,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 190 transitions, 701 flow [2022-12-06 16:30:30,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:30:30,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:30:30,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1114 transitions. [2022-12-06 16:30:30,732 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.779020979020979 [2022-12-06 16:30:30,733 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 12 predicate places. [2022-12-06 16:30:30,733 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 190 transitions, 701 flow [2022-12-06 16:30:30,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.85714285714286) internal successors, (559), 7 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:30,733 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:30:30,733 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:30:30,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 16:30:30,734 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:30:30,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:30:30,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1018506014, now seen corresponding path program 1 times [2022-12-06 16:30:30,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:30:30,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757252318] [2022-12-06 16:30:30,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:30:30,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:30:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:30:30,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:30:30,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:30:30,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757252318] [2022-12-06 16:30:30,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757252318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:30:30,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:30:30,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:30:30,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890335092] [2022-12-06 16:30:30,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:30:30,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:30:30,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:30:30,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:30:30,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:30:30,954 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 110 [2022-12-06 16:30:30,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 190 transitions, 701 flow. Second operand has 6 states, 6 states have (on average 91.0) internal successors, (546), 6 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:30,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:30:30,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 110 [2022-12-06 16:30:30,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:30:31,582 INFO L130 PetriNetUnfolder]: 1571/4647 cut-off events. [2022-12-06 16:30:31,582 INFO L131 PetriNetUnfolder]: For 1089/1702 co-relation queries the response was YES. [2022-12-06 16:30:31,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9880 conditions, 4647 events. 1571/4647 cut-off events. For 1089/1702 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 44348 event pairs, 175 based on Foata normal form. 4/4580 useless extension candidates. Maximal degree in co-relation 9813. Up to 1035 conditions per place. [2022-12-06 16:30:31,603 INFO L137 encePairwiseOnDemand]: 103/110 looper letters, 36 selfloop transitions, 5 changer transitions 199/320 dead transitions. [2022-12-06 16:30:31,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 320 transitions, 1757 flow [2022-12-06 16:30:31,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 16:30:31,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 16:30:31,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 863 transitions. [2022-12-06 16:30:31,605 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8717171717171717 [2022-12-06 16:30:31,606 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 20 predicate places. [2022-12-06 16:30:31,606 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 320 transitions, 1757 flow [2022-12-06 16:30:31,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.0) internal successors, (546), 6 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:31,607 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:30:31,607 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:30:31,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 16:30:31,607 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:30:31,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:30:31,608 INFO L85 PathProgramCache]: Analyzing trace with hash -870874857, now seen corresponding path program 1 times [2022-12-06 16:30:31,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:30:31,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373011113] [2022-12-06 16:30:31,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:30:31,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:30:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:30:32,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:30:32,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:30:32,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373011113] [2022-12-06 16:30:32,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373011113] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:30:32,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:30:32,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 16:30:32,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181843043] [2022-12-06 16:30:32,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:30:32,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 16:30:32,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:30:32,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 16:30:32,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-06 16:30:32,119 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 110 [2022-12-06 16:30:32,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 320 transitions, 1757 flow. Second operand has 10 states, 10 states have (on average 88.5) internal successors, (885), 10 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:32,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:30:32,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 110 [2022-12-06 16:30:32,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:30:32,826 INFO L130 PetriNetUnfolder]: 1937/6036 cut-off events. [2022-12-06 16:30:32,827 INFO L131 PetriNetUnfolder]: For 2363/3691 co-relation queries the response was YES. [2022-12-06 16:30:32,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14828 conditions, 6036 events. 1937/6036 cut-off events. For 2363/3691 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 63096 event pairs, 136 based on Foata normal form. 24/6009 useless extension candidates. Maximal degree in co-relation 14754. Up to 1499 conditions per place. [2022-12-06 16:30:32,847 INFO L137 encePairwiseOnDemand]: 99/110 looper letters, 37 selfloop transitions, 13 changer transitions 392/525 dead transitions. [2022-12-06 16:30:32,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 525 transitions, 3830 flow [2022-12-06 16:30:32,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 16:30:32,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 16:30:32,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1458 transitions. [2022-12-06 16:30:32,850 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8284090909090909 [2022-12-06 16:30:32,851 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 35 predicate places. [2022-12-06 16:30:32,851 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 525 transitions, 3830 flow [2022-12-06 16:30:32,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.5) internal successors, (885), 10 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:32,851 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:30:32,852 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:30:32,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 16:30:32,852 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:30:32,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:30:32,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1038139023, now seen corresponding path program 1 times [2022-12-06 16:30:32,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:30:32,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34018582] [2022-12-06 16:30:32,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:30:32,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:30:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:30:33,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:30:33,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:30:33,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34018582] [2022-12-06 16:30:33,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34018582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:30:33,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:30:33,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 16:30:33,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870932789] [2022-12-06 16:30:33,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:30:33,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 16:30:33,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:30:33,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 16:30:33,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-06 16:30:33,274 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 110 [2022-12-06 16:30:33,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 525 transitions, 3830 flow. Second operand has 10 states, 10 states have (on average 88.6) internal successors, (886), 10 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:33,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:30:33,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 110 [2022-12-06 16:30:33,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:30:34,121 INFO L130 PetriNetUnfolder]: 2443/7591 cut-off events. [2022-12-06 16:30:34,121 INFO L131 PetriNetUnfolder]: For 5298/6118 co-relation queries the response was YES. [2022-12-06 16:30:34,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21451 conditions, 7591 events. 2443/7591 cut-off events. For 5298/6118 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 82549 event pairs, 148 based on Foata normal form. 57/7596 useless extension candidates. Maximal degree in co-relation 21370. Up to 2093 conditions per place. [2022-12-06 16:30:34,153 INFO L137 encePairwiseOnDemand]: 99/110 looper letters, 45 selfloop transitions, 22 changer transitions 570/720 dead transitions. [2022-12-06 16:30:34,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 720 transitions, 6739 flow [2022-12-06 16:30:34,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:30:34,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:30:34,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1200 transitions. [2022-12-06 16:30:34,156 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8391608391608392 [2022-12-06 16:30:34,157 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 47 predicate places. [2022-12-06 16:30:34,157 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 720 transitions, 6739 flow [2022-12-06 16:30:34,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.6) internal successors, (886), 10 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:34,157 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:30:34,158 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:30:34,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 16:30:34,158 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:30:34,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:30:34,158 INFO L85 PathProgramCache]: Analyzing trace with hash 173560603, now seen corresponding path program 2 times [2022-12-06 16:30:34,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:30:34,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870361331] [2022-12-06 16:30:34,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:30:34,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:30:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:30:34,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:30:34,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:30:34,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870361331] [2022-12-06 16:30:34,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870361331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:30:34,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:30:34,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 16:30:34,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008177449] [2022-12-06 16:30:34,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:30:34,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 16:30:34,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:30:34,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 16:30:34,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-06 16:30:34,678 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 110 [2022-12-06 16:30:34,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 720 transitions, 6739 flow. Second operand has 11 states, 11 states have (on average 88.45454545454545) internal successors, (973), 11 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:34,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:30:34,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 110 [2022-12-06 16:30:34,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:30:35,840 INFO L130 PetriNetUnfolder]: 2929/9258 cut-off events. [2022-12-06 16:30:35,840 INFO L131 PetriNetUnfolder]: For 10048/11544 co-relation queries the response was YES. [2022-12-06 16:30:35,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29236 conditions, 9258 events. 2929/9258 cut-off events. For 10048/11544 co-relation queries the response was YES. Maximal size of possible extension queue 727. Compared 105850 event pairs, 169 based on Foata normal form. 65/9270 useless extension candidates. Maximal degree in co-relation 29148. Up to 2677 conditions per place. [2022-12-06 16:30:35,883 INFO L137 encePairwiseOnDemand]: 99/110 looper letters, 52 selfloop transitions, 23 changer transitions 700/858 dead transitions. [2022-12-06 16:30:35,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 858 transitions, 9667 flow [2022-12-06 16:30:35,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 16:30:35,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 16:30:35,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1467 transitions. [2022-12-06 16:30:35,887 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8335227272727272 [2022-12-06 16:30:35,888 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 62 predicate places. [2022-12-06 16:30:35,888 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 858 transitions, 9667 flow [2022-12-06 16:30:35,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 88.45454545454545) internal successors, (973), 11 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:35,888 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:30:35,888 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:30:35,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 16:30:35,889 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:30:35,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:30:35,889 INFO L85 PathProgramCache]: Analyzing trace with hash 461304175, now seen corresponding path program 3 times [2022-12-06 16:30:35,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:30:35,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855800383] [2022-12-06 16:30:35,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:30:35,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:30:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:30:36,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:30:36,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:30:36,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855800383] [2022-12-06 16:30:36,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855800383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:30:36,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:30:36,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 16:30:36,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052683816] [2022-12-06 16:30:36,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:30:36,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 16:30:36,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:30:36,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 16:30:36,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-06 16:30:36,743 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 110 [2022-12-06 16:30:36,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 858 transitions, 9667 flow. Second operand has 10 states, 10 states have (on average 79.4) internal successors, (794), 10 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:36,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:30:36,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 110 [2022-12-06 16:30:36,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:30:38,715 INFO L130 PetriNetUnfolder]: 3542/11798 cut-off events. [2022-12-06 16:30:38,715 INFO L131 PetriNetUnfolder]: For 13615/18926 co-relation queries the response was YES. [2022-12-06 16:30:38,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42811 conditions, 11798 events. 3542/11798 cut-off events. For 13615/18926 co-relation queries the response was YES. Maximal size of possible extension queue 957. Compared 144183 event pairs, 76 based on Foata normal form. 135/11887 useless extension candidates. Maximal degree in co-relation 42710. Up to 3462 conditions per place. [2022-12-06 16:30:38,775 INFO L137 encePairwiseOnDemand]: 92/110 looper letters, 73 selfloop transitions, 60 changer transitions 1256/1454 dead transitions. [2022-12-06 16:30:38,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 1454 transitions, 19016 flow [2022-12-06 16:30:38,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 16:30:38,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 16:30:38,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2422 transitions. [2022-12-06 16:30:38,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7592476489028214 [2022-12-06 16:30:38,780 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 90 predicate places. [2022-12-06 16:30:38,780 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 1454 transitions, 19016 flow [2022-12-06 16:30:38,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 79.4) internal successors, (794), 10 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:38,780 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:30:38,780 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:30:38,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 16:30:38,781 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:30:38,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:30:38,781 INFO L85 PathProgramCache]: Analyzing trace with hash 228283376, now seen corresponding path program 1 times [2022-12-06 16:30:38,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:30:38,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589515831] [2022-12-06 16:30:38,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:30:38,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:30:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:30:39,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:30:39,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:30:39,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589515831] [2022-12-06 16:30:39,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589515831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:30:39,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:30:39,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-06 16:30:39,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240716543] [2022-12-06 16:30:39,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:30:39,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 16:30:39,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:30:39,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 16:30:39,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-12-06 16:30:39,413 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 110 [2022-12-06 16:30:39,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 1454 transitions, 19016 flow. Second operand has 12 states, 12 states have (on average 85.66666666666667) internal successors, (1028), 12 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:39,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:30:39,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 110 [2022-12-06 16:30:39,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:30:41,449 INFO L130 PetriNetUnfolder]: 3801/12974 cut-off events. [2022-12-06 16:30:41,450 INFO L131 PetriNetUnfolder]: For 20399/33931 co-relation queries the response was YES. [2022-12-06 16:30:41,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50966 conditions, 12974 events. 3801/12974 cut-off events. For 20399/33931 co-relation queries the response was YES. Maximal size of possible extension queue 1050. Compared 163038 event pairs, 78 based on Foata normal form. 143/13067 useless extension candidates. Maximal degree in co-relation 50855. Up to 3787 conditions per place. [2022-12-06 16:30:41,511 INFO L137 encePairwiseOnDemand]: 98/110 looper letters, 93 selfloop transitions, 19 changer transitions 1424/1629 dead transitions. [2022-12-06 16:30:41,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 1629 transitions, 24262 flow [2022-12-06 16:30:41,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:30:41,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:30:41,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1158 transitions. [2022-12-06 16:30:41,515 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8097902097902098 [2022-12-06 16:30:41,515 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 102 predicate places. [2022-12-06 16:30:41,515 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 1629 transitions, 24262 flow [2022-12-06 16:30:41,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 85.66666666666667) internal successors, (1028), 12 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:41,516 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:30:41,516 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:30:41,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 16:30:41,516 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:30:41,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:30:41,517 INFO L85 PathProgramCache]: Analyzing trace with hash -271374368, now seen corresponding path program 2 times [2022-12-06 16:30:41,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:30:41,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913686158] [2022-12-06 16:30:41,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:30:41,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:30:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:30:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:30:42,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:30:42,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913686158] [2022-12-06 16:30:42,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913686158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:30:42,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:30:42,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-06 16:30:42,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529905545] [2022-12-06 16:30:42,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:30:42,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 16:30:42,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:30:42,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 16:30:42,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-06 16:30:42,100 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 110 [2022-12-06 16:30:42,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 1629 transitions, 24262 flow. Second operand has 12 states, 12 states have (on average 86.58333333333333) internal successors, (1039), 12 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:42,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:30:42,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 110 [2022-12-06 16:30:42,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:30:44,260 INFO L130 PetriNetUnfolder]: 3952/13608 cut-off events. [2022-12-06 16:30:44,261 INFO L131 PetriNetUnfolder]: For 28749/39078 co-relation queries the response was YES. [2022-12-06 16:30:44,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58016 conditions, 13608 events. 3952/13608 cut-off events. For 28749/39078 co-relation queries the response was YES. Maximal size of possible extension queue 1115. Compared 172970 event pairs, 89 based on Foata normal form. 256/13816 useless extension candidates. Maximal degree in co-relation 57896. Up to 4032 conditions per place. [2022-12-06 16:30:44,331 INFO L137 encePairwiseOnDemand]: 98/110 looper letters, 81 selfloop transitions, 37 changer transitions 1542/1754 dead transitions. [2022-12-06 16:30:44,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 1754 transitions, 29286 flow [2022-12-06 16:30:44,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 16:30:44,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 16:30:44,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1528 transitions. [2022-12-06 16:30:44,333 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8171122994652407 [2022-12-06 16:30:44,334 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 118 predicate places. [2022-12-06 16:30:44,335 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 1754 transitions, 29286 flow [2022-12-06 16:30:44,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 86.58333333333333) internal successors, (1039), 12 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:44,335 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:30:44,335 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:30:44,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 16:30:44,335 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:30:44,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:30:44,336 INFO L85 PathProgramCache]: Analyzing trace with hash -677278338, now seen corresponding path program 3 times [2022-12-06 16:30:44,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:30:44,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912655906] [2022-12-06 16:30:44,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:30:44,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:30:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:30:44,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:30:44,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:30:44,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912655906] [2022-12-06 16:30:44,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912655906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:30:44,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:30:44,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 16:30:44,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781982258] [2022-12-06 16:30:44,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:30:44,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 16:30:44,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:30:44,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 16:30:44,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-06 16:30:44,863 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 110 [2022-12-06 16:30:44,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 1754 transitions, 29286 flow. Second operand has 11 states, 11 states have (on average 86.72727272727273) internal successors, (954), 11 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:44,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:30:44,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 110 [2022-12-06 16:30:44,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:30:47,277 INFO L130 PetriNetUnfolder]: 3957/14443 cut-off events. [2022-12-06 16:30:47,277 INFO L131 PetriNetUnfolder]: For 37613/48828 co-relation queries the response was YES. [2022-12-06 16:30:47,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64931 conditions, 14443 events. 3957/14443 cut-off events. For 37613/48828 co-relation queries the response was YES. Maximal size of possible extension queue 1215. Compared 190452 event pairs, 84 based on Foata normal form. 103/14517 useless extension candidates. Maximal degree in co-relation 64802. Up to 4185 conditions per place. [2022-12-06 16:30:47,344 INFO L137 encePairwiseOnDemand]: 100/110 looper letters, 105 selfloop transitions, 22 changer transitions 1669/1890 dead transitions. [2022-12-06 16:30:47,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 1890 transitions, 34976 flow [2022-12-06 16:30:47,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:30:47,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:30:47,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1162 transitions. [2022-12-06 16:30:47,346 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8125874125874126 [2022-12-06 16:30:47,347 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 130 predicate places. [2022-12-06 16:30:47,347 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 1890 transitions, 34976 flow [2022-12-06 16:30:47,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 86.72727272727273) internal successors, (954), 11 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:47,347 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:30:47,347 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:30:47,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 16:30:47,348 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:30:47,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:30:47,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1080027876, now seen corresponding path program 1 times [2022-12-06 16:30:47,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:30:47,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888880215] [2022-12-06 16:30:47,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:30:47,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:30:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:30:47,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:30:47,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:30:47,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888880215] [2022-12-06 16:30:47,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888880215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:30:47,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:30:47,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:30:47,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685933595] [2022-12-06 16:30:47,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:30:47,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:30:47,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:30:47,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:30:47,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:30:47,494 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 110 [2022-12-06 16:30:47,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 1890 transitions, 34976 flow. Second operand has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:47,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:30:47,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 110 [2022-12-06 16:30:47,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:30:51,352 INFO L130 PetriNetUnfolder]: 5139/15288 cut-off events. [2022-12-06 16:30:51,353 INFO L131 PetriNetUnfolder]: For 120516/127001 co-relation queries the response was YES. [2022-12-06 16:30:51,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71215 conditions, 15288 events. 5139/15288 cut-off events. For 120516/127001 co-relation queries the response was YES. Maximal size of possible extension queue 862. Compared 179531 event pairs, 339 based on Foata normal form. 338/15106 useless extension candidates. Maximal degree in co-relation 71082. Up to 4953 conditions per place. [2022-12-06 16:30:51,443 INFO L137 encePairwiseOnDemand]: 100/110 looper letters, 160 selfloop transitions, 13 changer transitions 1131/1442 dead transitions. [2022-12-06 16:30:51,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 1442 transitions, 27539 flow [2022-12-06 16:30:51,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 16:30:51,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 16:30:51,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 944 transitions. [2022-12-06 16:30:51,445 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8581818181818182 [2022-12-06 16:30:51,445 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 139 predicate places. [2022-12-06 16:30:51,445 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 1442 transitions, 27539 flow [2022-12-06 16:30:51,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:51,446 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:30:51,446 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:30:51,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 16:30:51,446 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:30:51,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:30:51,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1670992556, now seen corresponding path program 1 times [2022-12-06 16:30:51,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:30:51,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102664270] [2022-12-06 16:30:51,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:30:51,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:30:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:30:51,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:30:51,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:30:51,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102664270] [2022-12-06 16:30:51,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102664270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:30:51,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:30:51,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:30:51,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741239934] [2022-12-06 16:30:51,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:30:51,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:30:51,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:30:51,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:30:51,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:30:51,573 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 110 [2022-12-06 16:30:51,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 1442 transitions, 27539 flow. Second operand has 7 states, 7 states have (on average 89.14285714285714) internal successors, (624), 7 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:51,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:30:51,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 110 [2022-12-06 16:30:51,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:30:53,170 INFO L130 PetriNetUnfolder]: 2701/6805 cut-off events. [2022-12-06 16:30:53,170 INFO L131 PetriNetUnfolder]: For 97920/106967 co-relation queries the response was YES. [2022-12-06 16:30:53,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34468 conditions, 6805 events. 2701/6805 cut-off events. For 97920/106967 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 63433 event pairs, 51 based on Foata normal form. 1236/7786 useless extension candidates. Maximal degree in co-relation 34331. Up to 1935 conditions per place. [2022-12-06 16:30:53,198 INFO L137 encePairwiseOnDemand]: 100/110 looper letters, 157 selfloop transitions, 34 changer transitions 532/846 dead transitions. [2022-12-06 16:30:53,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 846 transitions, 16542 flow [2022-12-06 16:30:53,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:30:53,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:30:53,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1229 transitions. [2022-12-06 16:30:53,200 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8594405594405594 [2022-12-06 16:30:53,200 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 123 predicate places. [2022-12-06 16:30:53,200 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 846 transitions, 16542 flow [2022-12-06 16:30:53,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.14285714285714) internal successors, (624), 7 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:53,201 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:30:53,201 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:30:53,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 16:30:53,201 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:30:53,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:30:53,201 INFO L85 PathProgramCache]: Analyzing trace with hash -892603023, now seen corresponding path program 1 times [2022-12-06 16:30:53,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:30:53,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123740253] [2022-12-06 16:30:53,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:30:53,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:30:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:30:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:30:53,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:30:53,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123740253] [2022-12-06 16:30:53,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123740253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:30:53,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:30:53,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:30:53,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879420102] [2022-12-06 16:30:53,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:30:53,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:30:53,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:30:53,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:30:53,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:30:53,327 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 110 [2022-12-06 16:30:53,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 846 transitions, 16542 flow. Second operand has 7 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:53,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:30:53,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 110 [2022-12-06 16:30:53,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:30:53,942 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][552], [323#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 299#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 193#(= ~y$r_buff0_thd0~0 0), 403#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 386#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 215#(= ~y$r_buff0_thd0~0 0), 246#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), 54#L3true, 147#true, P1Thread1of1ForFork0InUse, 124#true, 414#(= ~a~0 1), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 93#L806true, 163#true, 89#L771true, 92#L746true, 121#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0))]) [2022-12-06 16:30:53,942 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-06 16:30:53,942 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:30:53,942 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:30:53,943 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:30:54,046 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][552], [323#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 299#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 193#(= ~y$r_buff0_thd0~0 0), 403#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 109#L3-1true, 386#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 215#(= ~y$r_buff0_thd0~0 0), 246#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), 124#true, 147#true, P1Thread1of1ForFork0InUse, 414#(= ~a~0 1), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 93#L806true, 121#true, 163#true, 89#L771true, 92#L746true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0))]) [2022-12-06 16:30:54,047 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-06 16:30:54,047 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:54,047 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:54,047 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:54,048 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][654], [323#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 299#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 193#(= ~y$r_buff0_thd0~0 0), 403#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 386#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 215#(= ~y$r_buff0_thd0~0 0), 246#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), 54#L3true, P1Thread1of1ForFork0InUse, 124#true, 147#true, 414#(= ~a~0 1), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 21#L749true, 93#L806true, 89#L771true, 121#true, 163#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0))]) [2022-12-06 16:30:54,048 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-06 16:30:54,048 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:54,048 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:54,048 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:54,048 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][654], [323#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 299#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 193#(= ~y$r_buff0_thd0~0 0), 403#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 109#L3-1true, 386#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 215#(= ~y$r_buff0_thd0~0 0), 246#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), P1Thread1of1ForFork0InUse, 124#true, 147#true, 414#(= ~a~0 1), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 21#L749true, 93#L806true, 89#L771true, 121#true, 163#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0))]) [2022-12-06 16:30:54,049 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-06 16:30:54,049 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:54,049 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:54,049 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:54,049 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([321] L749-->L754: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][199], [407#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 193#(= ~y$r_buff0_thd0~0 0), 302#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 259#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)))), 215#(= ~y$r_buff0_thd0~0 0), 54#L3true, P1Thread1of1ForFork0InUse, 147#true, 414#(= ~a~0 1), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 31#L754true, 64#L799true, 127#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 327#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 ~y$r_buff0_thd0~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), 89#L771true, 121#true, 163#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0)), 388#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:30:54,049 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-06 16:30:54,049 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:54,049 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:54,049 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:54,051 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][551], [42#L774true, 323#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 299#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 407#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 193#(= ~y$r_buff0_thd0~0 0), 215#(= ~y$r_buff0_thd0~0 0), 246#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), 54#L3true, P1Thread1of1ForFork0InUse, 124#true, 147#true, 414#(= ~a~0 1), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 93#L806true, 121#true, 163#true, 92#L746true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0)), 388#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:30:54,051 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-06 16:30:54,052 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:54,052 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:54,052 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:54,052 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][657], [42#L774true, 323#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 299#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 407#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 193#(= ~y$r_buff0_thd0~0 0), 215#(= ~y$r_buff0_thd0~0 0), 246#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), 54#L3true, P1Thread1of1ForFork0InUse, 124#true, 147#true, 414#(= ~a~0 1), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 21#L749true, 93#L806true, 121#true, 163#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0)), 388#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:30:54,052 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-06 16:30:54,052 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:54,052 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:54,052 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:54,116 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([321] L749-->L754: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][489], [42#L774true, 193#(= ~y$r_buff0_thd0~0 0), 411#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 302#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 259#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)))), 215#(= ~y$r_buff0_thd0~0 0), 54#L3true, P1Thread1of1ForFork0InUse, 147#true, 414#(= ~a~0 1), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 31#L754true, 64#L799true, 127#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 327#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 ~y$r_buff0_thd0~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), 121#true, 163#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0)), 388#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:30:54,116 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-06 16:30:54,116 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:54,116 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:54,116 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:54,117 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([321] L749-->L754: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][199], [407#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 193#(= ~y$r_buff0_thd0~0 0), 302#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 259#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)))), 109#L3-1true, 215#(= ~y$r_buff0_thd0~0 0), P1Thread1of1ForFork0InUse, 147#true, 414#(= ~a~0 1), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 31#L754true, 64#L799true, 127#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 327#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 ~y$r_buff0_thd0~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), 89#L771true, 121#true, 163#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0)), 388#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:30:54,117 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-06 16:30:54,118 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:54,118 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:54,118 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:54,146 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][551], [42#L774true, 323#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 407#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 299#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 193#(= ~y$r_buff0_thd0~0 0), 109#L3-1true, 215#(= ~y$r_buff0_thd0~0 0), 246#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), P1Thread1of1ForFork0InUse, 124#true, 147#true, 414#(= ~a~0 1), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 93#L806true, 92#L746true, 121#true, 163#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0)), 388#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:30:54,146 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-06 16:30:54,146 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:54,146 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:54,146 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:54,146 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][657], [42#L774true, 323#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 299#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 407#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 193#(= ~y$r_buff0_thd0~0 0), 109#L3-1true, 215#(= ~y$r_buff0_thd0~0 0), 246#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), 124#true, 147#true, P1Thread1of1ForFork0InUse, 414#(= ~a~0 1), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 21#L749true, 93#L806true, 121#true, 163#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0)), 388#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:30:54,146 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-06 16:30:54,146 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:54,146 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:54,147 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:54,206 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([321] L749-->L754: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][489], [42#L774true, 193#(= ~y$r_buff0_thd0~0 0), 411#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 302#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 259#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)))), 109#L3-1true, 215#(= ~y$r_buff0_thd0~0 0), P1Thread1of1ForFork0InUse, 147#true, 414#(= ~a~0 1), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 31#L754true, 64#L799true, 127#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 327#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 ~y$r_buff0_thd0~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), 121#true, 163#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0)), 388#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:30:54,206 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-06 16:30:54,206 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:54,206 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:54,207 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:54,972 INFO L130 PetriNetUnfolder]: 4758/11913 cut-off events. [2022-12-06 16:30:54,972 INFO L131 PetriNetUnfolder]: For 198732/210108 co-relation queries the response was YES. [2022-12-06 16:30:54,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62939 conditions, 11913 events. 4758/11913 cut-off events. For 198732/210108 co-relation queries the response was YES. Maximal size of possible extension queue 861. Compared 121427 event pairs, 74 based on Foata normal form. 736/12278 useless extension candidates. Maximal degree in co-relation 62797. Up to 3324 conditions per place. [2022-12-06 16:30:55,009 INFO L137 encePairwiseOnDemand]: 104/110 looper letters, 122 selfloop transitions, 1 changer transitions 1179/1430 dead transitions. [2022-12-06 16:30:55,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 1430 transitions, 33214 flow [2022-12-06 16:30:55,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 16:30:55,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 16:30:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 666 transitions. [2022-12-06 16:30:55,010 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8649350649350649 [2022-12-06 16:30:55,011 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 129 predicate places. [2022-12-06 16:30:55,011 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 1430 transitions, 33214 flow [2022-12-06 16:30:55,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:55,011 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:30:55,011 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:30:55,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 16:30:55,012 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:30:55,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:30:55,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1463374011, now seen corresponding path program 2 times [2022-12-06 16:30:55,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:30:55,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324254958] [2022-12-06 16:30:55,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:30:55,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:30:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:30:55,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:30:55,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:30:55,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324254958] [2022-12-06 16:30:55,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324254958] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:30:55,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:30:55,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:30:55,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50372215] [2022-12-06 16:30:55,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:30:55,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:30:55,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:30:55,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:30:55,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:30:55,133 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 110 [2022-12-06 16:30:55,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 1430 transitions, 33214 flow. Second operand has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:55,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:30:55,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 110 [2022-12-06 16:30:55,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:30:56,040 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][706], [323#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 299#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 193#(= ~y$r_buff0_thd0~0 0), 403#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 386#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 215#(= ~y$r_buff0_thd0~0 0), 246#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), 54#L3true, P1Thread1of1ForFork0InUse, 124#true, 147#true, 427#true, P0Thread1of1ForFork2InUse, 414#(= ~a~0 1), P2Thread1of1ForFork1InUse, 93#L806true, 121#true, 163#true, 92#L746true, 89#L771true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0))]) [2022-12-06 16:30:56,040 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-06 16:30:56,040 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:30:56,040 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:30:56,040 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:30:56,217 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][706], [323#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 299#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 193#(= ~y$r_buff0_thd0~0 0), 403#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 386#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 109#L3-1true, 215#(= ~y$r_buff0_thd0~0 0), 246#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), 124#true, 147#true, P1Thread1of1ForFork0InUse, 427#true, P0Thread1of1ForFork2InUse, 414#(= ~a~0 1), P2Thread1of1ForFork1InUse, 93#L806true, 121#true, 163#true, 92#L746true, 89#L771true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0))]) [2022-12-06 16:30:56,217 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-06 16:30:56,217 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:56,217 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:56,217 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:56,219 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([321] L749-->L754: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][209], [407#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 193#(= ~y$r_buff0_thd0~0 0), 302#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 259#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)))), 215#(= ~y$r_buff0_thd0~0 0), 54#L3true, P1Thread1of1ForFork0InUse, 147#true, P0Thread1of1ForFork2InUse, 414#(= ~a~0 1), P2Thread1of1ForFork1InUse, 31#L754true, 64#L799true, 127#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 429#(= ~x~0 1), 327#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 ~y$r_buff0_thd0~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), 89#L771true, 121#true, 163#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0)), 388#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:30:56,219 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-06 16:30:56,219 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:56,219 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:56,219 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:56,219 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][837], [323#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 299#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 193#(= ~y$r_buff0_thd0~0 0), 403#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 386#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 215#(= ~y$r_buff0_thd0~0 0), 246#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), 54#L3true, P1Thread1of1ForFork0InUse, 124#true, 147#true, P0Thread1of1ForFork2InUse, 414#(= ~a~0 1), P2Thread1of1ForFork1InUse, 21#L749true, 93#L806true, 429#(= ~x~0 1), 121#true, 163#true, 89#L771true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0))]) [2022-12-06 16:30:56,219 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-06 16:30:56,219 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:56,219 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:56,219 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:56,220 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][837], [323#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 299#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 193#(= ~y$r_buff0_thd0~0 0), 403#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 386#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 109#L3-1true, 246#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), 215#(= ~y$r_buff0_thd0~0 0), P1Thread1of1ForFork0InUse, 124#true, 147#true, P0Thread1of1ForFork2InUse, 414#(= ~a~0 1), P2Thread1of1ForFork1InUse, 21#L749true, 93#L806true, 429#(= ~x~0 1), 121#true, 89#L771true, 163#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0))]) [2022-12-06 16:30:56,220 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-06 16:30:56,220 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:56,220 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:56,220 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:56,222 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][705], [42#L774true, 323#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 299#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 407#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 193#(= ~y$r_buff0_thd0~0 0), 215#(= ~y$r_buff0_thd0~0 0), 246#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), 54#L3true, P1Thread1of1ForFork0InUse, 124#true, 147#true, 427#true, P0Thread1of1ForFork2InUse, 414#(= ~a~0 1), P2Thread1of1ForFork1InUse, 93#L806true, 92#L746true, 121#true, 163#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0)), 388#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:30:56,222 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-06 16:30:56,222 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:56,222 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:56,222 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:30:56,223 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][834], [42#L774true, 323#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 299#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 407#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 193#(= ~y$r_buff0_thd0~0 0), 215#(= ~y$r_buff0_thd0~0 0), 246#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), 54#L3true, P1Thread1of1ForFork0InUse, 124#true, 147#true, P0Thread1of1ForFork2InUse, 414#(= ~a~0 1), P2Thread1of1ForFork1InUse, 21#L749true, 93#L806true, 429#(= ~x~0 1), 121#true, 163#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0)), 388#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:30:56,223 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-06 16:30:56,223 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:56,223 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:56,223 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:56,322 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([321] L749-->L754: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][553], [42#L774true, 193#(= ~y$r_buff0_thd0~0 0), 411#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 302#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 259#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)))), 215#(= ~y$r_buff0_thd0~0 0), 54#L3true, P1Thread1of1ForFork0InUse, 147#true, P0Thread1of1ForFork2InUse, 414#(= ~a~0 1), P2Thread1of1ForFork1InUse, 31#L754true, 64#L799true, 127#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 429#(= ~x~0 1), 327#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 ~y$r_buff0_thd0~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), 121#true, 163#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0)), 388#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:30:56,322 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-06 16:30:56,322 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:56,322 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:56,323 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:56,324 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([321] L749-->L754: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][209], [407#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 193#(= ~y$r_buff0_thd0~0 0), 302#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 259#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)))), 109#L3-1true, 215#(= ~y$r_buff0_thd0~0 0), P1Thread1of1ForFork0InUse, 147#true, P0Thread1of1ForFork2InUse, 414#(= ~a~0 1), P2Thread1of1ForFork1InUse, 31#L754true, 64#L799true, 127#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 429#(= ~x~0 1), 327#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 ~y$r_buff0_thd0~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), 89#L771true, 121#true, 163#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0)), 388#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:30:56,324 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-06 16:30:56,324 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:56,324 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:56,324 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:56,379 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][705], [42#L774true, 323#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 299#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 407#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 193#(= ~y$r_buff0_thd0~0 0), 109#L3-1true, 215#(= ~y$r_buff0_thd0~0 0), 246#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), P1Thread1of1ForFork0InUse, 124#true, 147#true, 427#true, P0Thread1of1ForFork2InUse, 414#(= ~a~0 1), P2Thread1of1ForFork1InUse, 93#L806true, 92#L746true, 121#true, 163#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0)), 388#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:30:56,379 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-06 16:30:56,379 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:56,379 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:56,379 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:30:56,379 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][834], [42#L774true, 323#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 299#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 407#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 193#(= ~y$r_buff0_thd0~0 0), 109#L3-1true, 215#(= ~y$r_buff0_thd0~0 0), 246#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), 124#true, P1Thread1of1ForFork0InUse, 147#true, P0Thread1of1ForFork2InUse, 414#(= ~a~0 1), P2Thread1of1ForFork1InUse, 21#L749true, 93#L806true, 429#(= ~x~0 1), 121#true, 163#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0)), 388#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:30:56,379 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-06 16:30:56,379 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:56,380 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:56,380 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:56,459 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([321] L749-->L754: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][553], [42#L774true, 193#(= ~y$r_buff0_thd0~0 0), 411#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 302#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 259#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)))), 109#L3-1true, 215#(= ~y$r_buff0_thd0~0 0), P1Thread1of1ForFork0InUse, 147#true, P0Thread1of1ForFork2InUse, 414#(= ~a~0 1), P2Thread1of1ForFork1InUse, 31#L754true, 64#L799true, 127#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 429#(= ~x~0 1), 327#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 ~y$r_buff0_thd0~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), 121#true, 163#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0)), 388#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:30:56,460 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-06 16:30:56,460 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:56,460 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:56,460 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:30:57,769 INFO L130 PetriNetUnfolder]: 6519/16533 cut-off events. [2022-12-06 16:30:57,769 INFO L131 PetriNetUnfolder]: For 336719/354703 co-relation queries the response was YES. [2022-12-06 16:30:57,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92173 conditions, 16533 events. 6519/16533 cut-off events. For 336719/354703 co-relation queries the response was YES. Maximal size of possible extension queue 1143. Compared 178870 event pairs, 88 based on Foata normal form. 1812/17884 useless extension candidates. Maximal degree in co-relation 92027. Up to 4600 conditions per place. [2022-12-06 16:30:57,829 INFO L137 encePairwiseOnDemand]: 104/110 looper letters, 89 selfloop transitions, 5 changer transitions 1792/2008 dead transitions. [2022-12-06 16:30:57,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 2008 transitions, 51729 flow [2022-12-06 16:30:57,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 16:30:57,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 16:30:57,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 856 transitions. [2022-12-06 16:30:57,833 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8646464646464647 [2022-12-06 16:30:57,833 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 137 predicate places. [2022-12-06 16:30:57,833 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 2008 transitions, 51729 flow [2022-12-06 16:30:57,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:57,834 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:30:57,834 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:30:57,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 16:30:57,834 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:30:57,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:30:57,834 INFO L85 PathProgramCache]: Analyzing trace with hash -981856063, now seen corresponding path program 1 times [2022-12-06 16:30:57,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:30:57,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120398260] [2022-12-06 16:30:57,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:30:57,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:30:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:30:58,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:30:58,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:30:58,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120398260] [2022-12-06 16:30:58,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120398260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:30:58,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:30:58,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 16:30:58,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001531831] [2022-12-06 16:30:58,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:30:58,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 16:30:58,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:30:58,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 16:30:58,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 16:30:58,015 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 110 [2022-12-06 16:30:58,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 2008 transitions, 51729 flow. Second operand has 8 states, 8 states have (on average 89.125) internal successors, (713), 8 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:30:58,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:30:58,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 110 [2022-12-06 16:30:58,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:31:00,394 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][704], [323#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 299#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 463#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 193#(= ~y$r_buff0_thd0~0 0), 403#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 386#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 215#(= ~y$r_buff0_thd0~0 0), 246#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), 54#L3true, 124#true, 147#true, P1Thread1of1ForFork0InUse, 427#true, P0Thread1of1ForFork2InUse, 414#(= ~a~0 1), P2Thread1of1ForFork1InUse, 93#L806true, 121#true, 163#true, 92#L746true, 89#L771true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0))]) [2022-12-06 16:31:00,395 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-06 16:31:00,395 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:31:00,395 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:31:00,395 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:31:00,821 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][704], [323#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 463#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 299#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 193#(= ~y$r_buff0_thd0~0 0), 403#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 109#L3-1true, 386#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 215#(= ~y$r_buff0_thd0~0 0), 246#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), 124#true, 147#true, P1Thread1of1ForFork0InUse, 427#true, P0Thread1of1ForFork2InUse, 414#(= ~a~0 1), P2Thread1of1ForFork1InUse, 93#L806true, 92#L746true, 121#true, 163#true, 89#L771true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0))]) [2022-12-06 16:31:00,821 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-06 16:31:00,821 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:31:00,821 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:31:00,821 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:31:00,823 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([321] L749-->L754: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][207], [407#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 193#(= ~y$r_buff0_thd0~0 0), 302#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 259#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)))), 467#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 215#(= ~y$r_buff0_thd0~0 0), 54#L3true, 147#true, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 414#(= ~a~0 1), P2Thread1of1ForFork1InUse, 31#L754true, 64#L799true, 127#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 429#(= ~x~0 1), 327#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 ~y$r_buff0_thd0~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), 163#true, 89#L771true, 121#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0)), 388#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:31:00,823 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-06 16:31:00,823 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:31:00,823 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:31:00,823 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:31:00,823 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][844], [323#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 299#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 463#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 193#(= ~y$r_buff0_thd0~0 0), 403#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 109#L3-1true, 386#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 215#(= ~y$r_buff0_thd0~0 0), 246#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), P1Thread1of1ForFork0InUse, 124#true, 147#true, P0Thread1of1ForFork2InUse, 414#(= ~a~0 1), P2Thread1of1ForFork1InUse, 21#L749true, 93#L806true, 429#(= ~x~0 1), 121#true, 163#true, 89#L771true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0))]) [2022-12-06 16:31:00,823 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-06 16:31:00,823 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:31:00,824 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:31:00,824 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:31:00,824 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][844], [323#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 463#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 299#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 193#(= ~y$r_buff0_thd0~0 0), 403#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 386#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 215#(= ~y$r_buff0_thd0~0 0), 246#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), 54#L3true, 124#true, 147#true, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 414#(= ~a~0 1), P2Thread1of1ForFork1InUse, 21#L749true, 93#L806true, 429#(= ~x~0 1), 121#true, 163#true, 89#L771true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0))]) [2022-12-06 16:31:00,824 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-06 16:31:00,824 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:31:00,824 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:31:00,824 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:31:00,828 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][843], [42#L774true, 323#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 299#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 407#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 193#(= ~y$r_buff0_thd0~0 0), 467#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 215#(= ~y$r_buff0_thd0~0 0), 246#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), 54#L3true, P1Thread1of1ForFork0InUse, 124#true, 147#true, P0Thread1of1ForFork2InUse, 414#(= ~a~0 1), P2Thread1of1ForFork1InUse, 21#L749true, 93#L806true, 429#(= ~x~0 1), 121#true, 163#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0)), 388#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:31:00,828 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-06 16:31:00,828 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:31:00,828 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:31:00,828 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:31:00,828 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][706], [42#L774true, 323#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 299#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 407#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 193#(= ~y$r_buff0_thd0~0 0), 467#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 215#(= ~y$r_buff0_thd0~0 0), 246#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), 54#L3true, P1Thread1of1ForFork0InUse, 124#true, 147#true, 427#true, P0Thread1of1ForFork2InUse, 414#(= ~a~0 1), P2Thread1of1ForFork1InUse, 93#L806true, 92#L746true, 121#true, 163#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0)), 388#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:31:00,828 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-06 16:31:00,829 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:31:00,829 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:31:00,829 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 16:31:01,102 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([321] L749-->L754: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][547], [42#L774true, 193#(= ~y$r_buff0_thd0~0 0), 411#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 302#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 259#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)))), 215#(= ~y$r_buff0_thd0~0 0), 54#L3true, 147#true, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 414#(= ~a~0 1), P2Thread1of1ForFork1InUse, 471#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 31#L754true, 64#L799true, 127#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 429#(= ~x~0 1), 327#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 ~y$r_buff0_thd0~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), 121#true, 163#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0)), 388#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:31:01,102 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-06 16:31:01,102 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:31:01,102 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:31:01,102 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:31:01,106 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([321] L749-->L754: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][207], [407#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 193#(= ~y$r_buff0_thd0~0 0), 302#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 259#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)))), 109#L3-1true, 467#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 215#(= ~y$r_buff0_thd0~0 0), 147#true, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 414#(= ~a~0 1), P2Thread1of1ForFork1InUse, 31#L754true, 64#L799true, 127#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 429#(= ~x~0 1), 327#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 ~y$r_buff0_thd0~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), 89#L771true, 121#true, 163#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0)), 388#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:31:01,106 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-06 16:31:01,106 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:31:01,106 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:31:01,106 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:31:01,255 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][843], [42#L774true, 323#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 299#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 407#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 193#(= ~y$r_buff0_thd0~0 0), 467#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 109#L3-1true, 215#(= ~y$r_buff0_thd0~0 0), 246#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), 124#true, 147#true, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 414#(= ~a~0 1), P2Thread1of1ForFork1InUse, 21#L749true, 93#L806true, 429#(= ~x~0 1), 121#true, 163#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0)), 388#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:31:01,255 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-06 16:31:01,255 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:31:01,255 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:31:01,255 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:31:01,255 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][706], [42#L774true, 323#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 299#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 407#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 193#(= ~y$r_buff0_thd0~0 0), 109#L3-1true, 467#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 215#(= ~y$r_buff0_thd0~0 0), 246#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), 124#true, 147#true, P1Thread1of1ForFork0InUse, 427#true, P0Thread1of1ForFork2InUse, 414#(= ~a~0 1), P2Thread1of1ForFork1InUse, 93#L806true, 92#L746true, 121#true, 163#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0)), 388#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:31:01,256 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-06 16:31:01,256 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:31:01,256 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:31:01,256 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:31:01,473 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([321] L749-->L754: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][547], [42#L774true, 193#(= ~y$r_buff0_thd0~0 0), 411#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 302#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 259#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)))), 109#L3-1true, 215#(= ~y$r_buff0_thd0~0 0), 147#true, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 414#(= ~a~0 1), P2Thread1of1ForFork1InUse, 471#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 31#L754true, 64#L799true, 127#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), 429#(= ~x~0 1), 327#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 ~y$r_buff0_thd0~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y~0 1)), 121#true, 163#true, 355#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0)), 388#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:31:01,473 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-06 16:31:01,473 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:31:01,473 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:31:01,473 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:31:02,086 INFO L130 PetriNetUnfolder]: 5835/12893 cut-off events. [2022-12-06 16:31:02,087 INFO L131 PetriNetUnfolder]: For 304581/325763 co-relation queries the response was YES. [2022-12-06 16:31:02,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79619 conditions, 12893 events. 5835/12893 cut-off events. For 304581/325763 co-relation queries the response was YES. Maximal size of possible extension queue 1132. Compared 131628 event pairs, 88 based on Foata normal form. 3143/15677 useless extension candidates. Maximal degree in co-relation 79469. Up to 3200 conditions per place. [2022-12-06 16:31:02,144 INFO L137 encePairwiseOnDemand]: 100/110 looper letters, 20 selfloop transitions, 12 changer transitions 1243/1349 dead transitions. [2022-12-06 16:31:02,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 1349 transitions, 37441 flow [2022-12-06 16:31:02,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 16:31:02,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 16:31:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1483 transitions. [2022-12-06 16:31:02,146 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8426136363636364 [2022-12-06 16:31:02,146 INFO L294 CegarLoopForPetriNet]: 115 programPoint places, 104 predicate places. [2022-12-06 16:31:02,146 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 1349 transitions, 37441 flow [2022-12-06 16:31:02,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.125) internal successors, (713), 8 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:31:02,146 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:31:02,147 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:31:02,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 16:31:02,147 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:31:02,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:31:02,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1780984767, now seen corresponding path program 1 times [2022-12-06 16:31:02,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:31:02,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898163008] [2022-12-06 16:31:02,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:31:02,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:31:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:31:02,184 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 16:31:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:31:02,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 16:31:02,243 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 16:31:02,243 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 16:31:02,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 16:31:02,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 16:31:02,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 16:31:02,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 16:31:02,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 16:31:02,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 16:31:02,249 INFO L458 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:31:02,253 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 16:31:02,254 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 16:31:02,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:31:02 BasicIcfg [2022-12-06 16:31:02,333 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 16:31:02,333 INFO L158 Benchmark]: Toolchain (without parser) took 35234.61ms. Allocated memory was 210.8MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 186.2MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-12-06 16:31:02,333 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 210.8MB. Free memory was 187.6MB in the beginning and 187.5MB in the end (delta: 80.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 16:31:02,333 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.87ms. Allocated memory is still 210.8MB. Free memory was 186.2MB in the beginning and 160.0MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 16:31:02,334 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.44ms. Allocated memory is still 210.8MB. Free memory was 160.0MB in the beginning and 156.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 16:31:02,335 INFO L158 Benchmark]: Boogie Preprocessor took 43.34ms. Allocated memory is still 210.8MB. Free memory was 156.8MB in the beginning and 155.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 16:31:02,335 INFO L158 Benchmark]: RCFGBuilder took 576.49ms. Allocated memory is still 210.8MB. Free memory was 155.3MB in the beginning and 122.2MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-06 16:31:02,335 INFO L158 Benchmark]: TraceAbstraction took 34134.36ms. Allocated memory was 210.8MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 121.7MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-12-06 16:31:02,337 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 210.8MB. Free memory was 187.6MB in the beginning and 187.5MB in the end (delta: 80.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 415.87ms. Allocated memory is still 210.8MB. Free memory was 186.2MB in the beginning and 160.0MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.44ms. Allocated memory is still 210.8MB. Free memory was 160.0MB in the beginning and 156.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.34ms. Allocated memory is still 210.8MB. Free memory was 156.8MB in the beginning and 155.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 576.49ms. Allocated memory is still 210.8MB. Free memory was 155.3MB in the beginning and 122.2MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 34134.36ms. Allocated memory was 210.8MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 121.7MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L715] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L722] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L723] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L724] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L725] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L726] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L727] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L728] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L729] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L730] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L731] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L732] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L733] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L734] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L735] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L736] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L737] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L740] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L823] 0 pthread_t t1196; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1196={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] FCALL, FORK 0 pthread_create(&t1196, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1196, ((void *)0), P0, ((void *)0))=-2, t1196={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1197; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t1197, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1197, ((void *)0), P1, ((void *)0))=-1, t1196={5:0}, t1197={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1198; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L828] FCALL, FORK 0 pthread_create(&t1198, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1198, ((void *)0), P2, ((void *)0))=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L784] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L784] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L846] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L847] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L848] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L849] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L851] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=53, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 34.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 27.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1232 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1232 mSDsluCounter, 1135 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 891 mSDsCounter, 153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2088 IncrementalHoareTripleChecker+Invalid, 2241 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 153 mSolverCounterUnsat, 244 mSDtfsCounter, 2088 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 242 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51729occurred in iteration=14, InterpolantAutomatonStates: 197, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 1229 NumberOfCodeBlocks, 1229 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1128 ConstructedInterpolants, 0 QuantifiedInterpolants, 5576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 16:31:02,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...