/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/mix056_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 16:32:41,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 16:32:41,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 16:32:41,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 16:32:41,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 16:32:41,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 16:32:41,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 16:32:41,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 16:32:41,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 16:32:41,354 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 16:32:41,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 16:32:41,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 16:32:41,356 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 16:32:41,357 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 16:32:41,357 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 16:32:41,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 16:32:41,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 16:32:41,359 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 16:32:41,361 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 16:32:41,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 16:32:41,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 16:32:41,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 16:32:41,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 16:32:41,376 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 16:32:41,383 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 16:32:41,383 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 16:32:41,383 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 16:32:41,384 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 16:32:41,384 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 16:32:41,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 16:32:41,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 16:32:41,385 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 16:32:41,386 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 16:32:41,386 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 16:32:41,387 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 16:32:41,387 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 16:32:41,388 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 16:32:41,388 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 16:32:41,388 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 16:32:41,389 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 16:32:41,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 16:32:41,396 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:32:41,422 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 16:32:41,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 16:32:41,424 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 16:32:41,424 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 16:32:41,424 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 16:32:41,425 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 16:32:41,425 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 16:32:41,425 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 16:32:41,425 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 16:32:41,425 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 16:32:41,426 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 16:32:41,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 16:32:41,426 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 16:32:41,426 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 16:32:41,426 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 16:32:41,427 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 16:32:41,427 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 16:32:41,427 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 16:32:41,427 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 16:32:41,427 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 16:32:41,427 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 16:32:41,427 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 16:32:41,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 16:32:41,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:32:41,428 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 16:32:41,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 16:32:41,428 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 16:32:41,428 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 16:32:41,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 16:32:41,428 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 16:32:41,428 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 16:32:41,428 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:32:41,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 16:32:41,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 16:32:41,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 16:32:41,693 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 16:32:41,694 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 16:32:41,695 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 16:32:42,600 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 16:32:42,869 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 16:32:42,869 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 16:32:42,883 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/117d0d929/80e3fada52e4411aa46e05bb34320370/FLAGa8fe84087 [2022-12-06 16:32:42,895 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/117d0d929/80e3fada52e4411aa46e05bb34320370 [2022-12-06 16:32:42,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 16:32:42,898 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 16:32:42,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 16:32:42,898 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 16:32:42,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 16:32:42,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:32:42" (1/1) ... [2022-12-06 16:32:42,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d3f2d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:42, skipping insertion in model container [2022-12-06 16:32:42,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:32:42" (1/1) ... [2022-12-06 16:32:42,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 16:32:42,951 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 16:32:43,082 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/mix056_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 16:32:43,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:32:43,290 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 16:32:43,298 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/mix056_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 16:32:43,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:32:43,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:32:43,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:32:43,347 INFO L208 MainTranslator]: Completed translation [2022-12-06 16:32:43,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:43 WrapperNode [2022-12-06 16:32:43,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 16:32:43,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 16:32:43,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 16:32:43,349 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 16:32:43,354 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:32:43" (1/1) ... [2022-12-06 16:32:43,376 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:32:43" (1/1) ... [2022-12-06 16:32:43,392 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2022-12-06 16:32:43,393 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 16:32:43,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 16:32:43,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 16:32:43,394 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 16:32:43,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:43" (1/1) ... [2022-12-06 16:32:43,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:43" (1/1) ... [2022-12-06 16:32:43,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:43" (1/1) ... [2022-12-06 16:32:43,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:43" (1/1) ... [2022-12-06 16:32:43,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:43" (1/1) ... [2022-12-06 16:32:43,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:43" (1/1) ... [2022-12-06 16:32:43,418 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:43" (1/1) ... [2022-12-06 16:32:43,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:43" (1/1) ... [2022-12-06 16:32:43,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 16:32:43,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 16:32:43,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 16:32:43,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 16:32:43,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:43" (1/1) ... [2022-12-06 16:32:43,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:32:43,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:32:43,459 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:32:43,477 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:32:43,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 16:32:43,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 16:32:43,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 16:32:43,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 16:32:43,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 16:32:43,496 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 16:32:43,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 16:32:43,496 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 16:32:43,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 16:32:43,496 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 16:32:43,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 16:32:43,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 16:32:43,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 16:32:43,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 16:32:43,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 16:32:43,498 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:32:43,625 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 16:32:43,627 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 16:32:43,901 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 16:32:44,028 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 16:32:44,029 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 16:32:44,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:32:44 BoogieIcfgContainer [2022-12-06 16:32:44,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 16:32:44,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 16:32:44,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 16:32:44,034 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 16:32:44,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:32:42" (1/3) ... [2022-12-06 16:32:44,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545e293d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:32:44, skipping insertion in model container [2022-12-06 16:32:44,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:43" (2/3) ... [2022-12-06 16:32:44,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545e293d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:32:44, skipping insertion in model container [2022-12-06 16:32:44,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:32:44" (3/3) ... [2022-12-06 16:32:44,041 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 16:32:44,073 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 16:32:44,073 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 16:32:44,073 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 16:32:44,138 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 16:32:44,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-06 16:32:44,246 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-06 16:32:44,246 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:32:44,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 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/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 16:32:44,251 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-06 16:32:44,255 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-06 16:32:44,272 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 16:32:44,278 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;@47ba5881, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 16:32:44,279 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 16:32:44,291 INFO L130 PetriNetUnfolder]: 0/42 cut-off events. [2022-12-06 16:32:44,291 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:32:44,292 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:32:44,292 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] [2022-12-06 16:32:44,293 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:32:44,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:32:44,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1840646246, now seen corresponding path program 1 times [2022-12-06 16:32:44,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:32:44,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699581501] [2022-12-06 16:32:44,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:32:44,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:32:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:32:44,726 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:32:44,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:32:44,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699581501] [2022-12-06 16:32:44,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699581501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:32:44,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:32:44,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 16:32:44,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771651606] [2022-12-06 16:32:44,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:32:44,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 16:32:44,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:32:44,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 16:32:44,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 16:32:44,778 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107 [2022-12-06 16:32:44,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 104 transitions, 217 flow. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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:32:44,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:32:44,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107 [2022-12-06 16:32:44,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:32:44,920 INFO L130 PetriNetUnfolder]: 58/268 cut-off events. [2022-12-06 16:32:44,921 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-06 16:32:44,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 268 events. 58/268 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1098 event pairs, 10 based on Foata normal form. 22/272 useless extension candidates. Maximal degree in co-relation 349. Up to 79 conditions per place. [2022-12-06 16:32:44,926 INFO L137 encePairwiseOnDemand]: 102/107 looper letters, 14 selfloop transitions, 2 changer transitions 0/106 dead transitions. [2022-12-06 16:32:44,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 106 transitions, 259 flow [2022-12-06 16:32:44,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 16:32:44,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 16:32:44,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2022-12-06 16:32:44,940 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9345794392523364 [2022-12-06 16:32:44,945 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 0 predicate places. [2022-12-06 16:32:44,945 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 106 transitions, 259 flow [2022-12-06 16:32:44,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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:32:44,946 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:32:44,946 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] [2022-12-06 16:32:44,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 16:32:44,947 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:32:44,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:32:44,948 INFO L85 PathProgramCache]: Analyzing trace with hash -326884727, now seen corresponding path program 1 times [2022-12-06 16:32:44,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:32:44,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752365297] [2022-12-06 16:32:44,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:32:44,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:32:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:32:45,366 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:32:45,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:32:45,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752365297] [2022-12-06 16:32:45,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752365297] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:32:45,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:32:45,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:32:45,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661284016] [2022-12-06 16:32:45,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:32:45,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:32:45,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:32:45,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:32:45,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:32:45,370 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2022-12-06 16:32:45,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 106 transitions, 259 flow. Second operand has 7 states, 7 states have (on average 81.85714285714286) internal successors, (573), 7 states have internal predecessors, (573), 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:32:45,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:32:45,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2022-12-06 16:32:45,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:32:46,285 INFO L130 PetriNetUnfolder]: 2476/5880 cut-off events. [2022-12-06 16:32:46,285 INFO L131 PetriNetUnfolder]: For 1358/2818 co-relation queries the response was YES. [2022-12-06 16:32:46,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11464 conditions, 5880 events. 2476/5880 cut-off events. For 1358/2818 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 50791 event pairs, 293 based on Foata normal form. 1/5686 useless extension candidates. Maximal degree in co-relation 11410. Up to 1536 conditions per place. [2022-12-06 16:32:46,312 INFO L137 encePairwiseOnDemand]: 97/107 looper letters, 52 selfloop transitions, 9 changer transitions 121/250 dead transitions. [2022-12-06 16:32:46,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 250 transitions, 1078 flow [2022-12-06 16:32:46,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:32:46,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:32:46,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1177 transitions. [2022-12-06 16:32:46,316 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8461538461538461 [2022-12-06 16:32:46,316 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 12 predicate places. [2022-12-06 16:32:46,316 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 250 transitions, 1078 flow [2022-12-06 16:32:46,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.85714285714286) internal successors, (573), 7 states have internal predecessors, (573), 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:32:46,317 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:32:46,317 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:32:46,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 16:32:46,318 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:32:46,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:32:46,319 INFO L85 PathProgramCache]: Analyzing trace with hash -497943510, now seen corresponding path program 1 times [2022-12-06 16:32:46,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:32:46,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334028095] [2022-12-06 16:32:46,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:32:46,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:32:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:32:46,552 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:32:46,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:32:46,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334028095] [2022-12-06 16:32:46,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334028095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:32:46,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:32:46,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:32:46,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599210073] [2022-12-06 16:32:46,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:32:46,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:32:46,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:32:46,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:32:46,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:32:46,555 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2022-12-06 16:32:46,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 250 transitions, 1078 flow. Second operand has 7 states, 7 states have (on average 82.0) internal successors, (574), 7 states have internal predecessors, (574), 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:32:46,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:32:46,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2022-12-06 16:32:46,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:32:47,692 INFO L130 PetriNetUnfolder]: 3737/9342 cut-off events. [2022-12-06 16:32:47,692 INFO L131 PetriNetUnfolder]: For 2189/4975 co-relation queries the response was YES. [2022-12-06 16:32:47,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23562 conditions, 9342 events. 3737/9342 cut-off events. For 2189/4975 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 91287 event pairs, 207 based on Foata normal form. 28/9196 useless extension candidates. Maximal degree in co-relation 23502. Up to 2391 conditions per place. [2022-12-06 16:32:47,780 INFO L137 encePairwiseOnDemand]: 96/107 looper letters, 64 selfloop transitions, 14 changer transitions 371/517 dead transitions. [2022-12-06 16:32:47,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 517 transitions, 3313 flow [2022-12-06 16:32:47,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:32:47,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:32:47,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1171 transitions. [2022-12-06 16:32:47,783 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8418404025880661 [2022-12-06 16:32:47,784 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 24 predicate places. [2022-12-06 16:32:47,784 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 517 transitions, 3313 flow [2022-12-06 16:32:47,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.0) internal successors, (574), 7 states have internal predecessors, (574), 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:32:47,784 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:32:47,785 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] [2022-12-06 16:32:47,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 16:32:47,785 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:32:47,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:32:47,786 INFO L85 PathProgramCache]: Analyzing trace with hash -340373909, now seen corresponding path program 1 times [2022-12-06 16:32:47,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:32:47,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332846685] [2022-12-06 16:32:47,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:32:47,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:32:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:32:47,947 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:32:47,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:32:47,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332846685] [2022-12-06 16:32:47,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332846685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:32:47,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:32:47,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:32:47,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258916225] [2022-12-06 16:32:47,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:32:47,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:32:47,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:32:47,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:32:47,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:32:47,952 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 107 [2022-12-06 16:32:47,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 517 transitions, 3313 flow. Second operand has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 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:32:47,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:32:47,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 107 [2022-12-06 16:32:47,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:32:48,386 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([338] L791-->L807: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_64 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and .cse10 .cse7)) (.cse11 (= (mod v_~z$w_buff0_used~0_142 256) 0)) (.cse2 (and (= (mod v_~z$w_buff1_used~0_121 256) 0) .cse7))) (let ((.cse6 (= (mod v_~z$w_buff1_used~0_120 256) 0)) (.cse3 (= (mod v_~z$w_buff0_used~0_141 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse4 (or .cse1 .cse11 .cse2)) (.cse5 (and .cse8 (not .cse11)))) (and (= v_~z$w_buff1_used~0_120 (ite .cse0 v_~z$w_buff1_used~0_121 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_121 0))) (= |v_P2Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse4 v_~z~0_85 (ite .cse5 v_~z$w_buff0~0_58 v_~z$w_buff1~0_71)) v_~__unbuffered_p2_EAX~0_16) (= |v_P2Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_38) (= v_~z$w_buff1~0_70 v_~z$w_buff1~0_71) (= v_~z~0_84 (ite .cse0 v_~z$mem_tmp~0_14 v_~__unbuffered_p2_EAX~0_16)) (= v_~z$w_buff0~0_58 v_~z$w_buff0~0_57) (= v_~z$flush_delayed~0_23 0) (= v_~z$r_buff0_thd3~0_67 (ite .cse0 v_~z$r_buff0_thd3~0_68 (ite (or .cse1 (and .cse6 .cse7) .cse3) v_~z$r_buff0_thd3~0_68 (ite (and .cse8 (not .cse3)) 0 v_~z$r_buff0_thd3~0_68)))) (= (ite .cse0 v_~z$r_buff1_thd3~0_64 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_67 256) 0))) (or (and .cse6 .cse9) .cse3 (and .cse10 .cse9))) v_~z$r_buff1_thd3~0_64 0)) v_~z$r_buff1_thd3~0_63) (= v_~z$w_buff0_used~0_141 (ite .cse0 v_~z$w_buff0_used~0_142 (ite .cse4 v_~z$w_buff0_used~0_142 (ite .cse5 0 v_~z$w_buff0_used~0_142)))) (= v_~z$mem_tmp~0_14 v_~z~0_85))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_142, ~z$w_buff0~0=v_~z$w_buff0~0_58, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_64, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_121, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~z$w_buff1~0=v_~z$w_buff1~0_71, ~z~0=v_~z~0_85, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_141, ~z$w_buff0~0=v_~z$w_buff0~0_57, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_63, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_120, ~z$w_buff1~0=v_~z$w_buff1~0_70, ~z$flush_delayed~0=v_~z$flush_delayed~0_23, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z~0=v_~z~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_38} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][173], [P1Thread1of1ForFork0InUse, 51#L3true, P2Thread1of1ForFork1InUse, 24#L807true, P0Thread1of1ForFork2InUse, 41#L774true, 46#L751true, 118#true, 144#true, 121#true, 178#(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))]) [2022-12-06 16:32:48,388 INFO L382 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-12-06 16:32:48,388 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:32:48,388 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:32:48,388 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:32:48,388 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_121 256) 0))) (.cse2 (not (= (mod v_~z$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_122 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~z$w_buff1_used~0_101 256) 0)))) (.cse4 (and .cse3 .cse5))) (and (= v_~z~0_60 (ite .cse0 v_~z$w_buff0~0_43 (ite .cse1 v_~z$w_buff1~0_56 v_~z~0_61))) (= v_~z$w_buff0_used~0_121 (ite .cse0 0 v_~z$w_buff0_used~0_122)) (= v_~z$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_100 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd2~0_25 256) 0)))) 0 v_~z$r_buff1_thd2~0_24)) (= v_~z$r_buff0_thd2~0_25 (ite .cse4 0 v_~z$r_buff0_thd2~0_26)) (= v_~z$w_buff1_used~0_100 (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_101))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_122, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$w_buff1~0=v_~z$w_buff1~0_56, ~z~0=v_~z~0_61, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_121, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, ~z$w_buff1~0=v_~z$w_buff1~0_56, ~z~0=v_~z~0_60, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0][174], [P1Thread1of1ForFork0InUse, 51#L3true, P2Thread1of1ForFork1InUse, 124#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), 147#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), P0Thread1of1ForFork2InUse, 78#L781true, 70#L791true, 46#L751true, 118#true, 178#(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))]) [2022-12-06 16:32:48,388 INFO L382 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-12-06 16:32:48,389 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:32:48,389 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:32:48,389 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:32:48,470 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([325] L754-->L761: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_31 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse0 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_125 256) 0)))) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_146 256) 0)) .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_125) v_~z$w_buff1_used~0_124) (= v_~z$r_buff0_thd1~0_30 (ite .cse1 0 v_~z$r_buff0_thd1~0_31)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd1~0_30 256) 0)) .cse2) (and (not (= (mod v_~z$w_buff1_used~0_124 256) 0)) .cse3)) 0 v_~z$r_buff1_thd1~0_20) v_~z$r_buff1_thd1~0_19) (= v_~z~0_88 (ite .cse4 v_~z$w_buff0~0_61 (ite .cse0 v_~z$w_buff1~0_74 v_~z~0_89))) (= v_~z$w_buff0_used~0_145 (ite .cse4 0 v_~z$w_buff0_used~0_146))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_146, ~z$w_buff0~0=v_~z$w_buff0~0_61, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_125, ~z$w_buff1~0=v_~z$w_buff1~0_74, ~z~0=v_~z~0_89, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_31} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_145, ~z$w_buff0~0=v_~z$w_buff0~0_61, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_124, ~z$w_buff1~0=v_~z$w_buff1~0_74, ~z~0=v_~z~0_88, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_30} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][175], [P1Thread1of1ForFork0InUse, 51#L3true, P2Thread1of1ForFork1InUse, 124#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), 147#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), P0Thread1of1ForFork2InUse, 85#L761true, 41#L774true, 70#L791true, 118#true, 178#(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))]) [2022-12-06 16:32:48,470 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:32:48,471 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:48,471 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:48,471 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:48,471 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([338] L791-->L807: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_64 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and .cse10 .cse7)) (.cse11 (= (mod v_~z$w_buff0_used~0_142 256) 0)) (.cse2 (and (= (mod v_~z$w_buff1_used~0_121 256) 0) .cse7))) (let ((.cse6 (= (mod v_~z$w_buff1_used~0_120 256) 0)) (.cse3 (= (mod v_~z$w_buff0_used~0_141 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse4 (or .cse1 .cse11 .cse2)) (.cse5 (and .cse8 (not .cse11)))) (and (= v_~z$w_buff1_used~0_120 (ite .cse0 v_~z$w_buff1_used~0_121 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_121 0))) (= |v_P2Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse4 v_~z~0_85 (ite .cse5 v_~z$w_buff0~0_58 v_~z$w_buff1~0_71)) v_~__unbuffered_p2_EAX~0_16) (= |v_P2Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_38) (= v_~z$w_buff1~0_70 v_~z$w_buff1~0_71) (= v_~z~0_84 (ite .cse0 v_~z$mem_tmp~0_14 v_~__unbuffered_p2_EAX~0_16)) (= v_~z$w_buff0~0_58 v_~z$w_buff0~0_57) (= v_~z$flush_delayed~0_23 0) (= v_~z$r_buff0_thd3~0_67 (ite .cse0 v_~z$r_buff0_thd3~0_68 (ite (or .cse1 (and .cse6 .cse7) .cse3) v_~z$r_buff0_thd3~0_68 (ite (and .cse8 (not .cse3)) 0 v_~z$r_buff0_thd3~0_68)))) (= (ite .cse0 v_~z$r_buff1_thd3~0_64 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_67 256) 0))) (or (and .cse6 .cse9) .cse3 (and .cse10 .cse9))) v_~z$r_buff1_thd3~0_64 0)) v_~z$r_buff1_thd3~0_63) (= v_~z$w_buff0_used~0_141 (ite .cse0 v_~z$w_buff0_used~0_142 (ite .cse4 v_~z$w_buff0_used~0_142 (ite .cse5 0 v_~z$w_buff0_used~0_142)))) (= v_~z$mem_tmp~0_14 v_~z~0_85))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_142, ~z$w_buff0~0=v_~z$w_buff0~0_58, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_64, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_121, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~z$w_buff1~0=v_~z$w_buff1~0_71, ~z~0=v_~z~0_85, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_141, ~z$w_buff0~0=v_~z$w_buff0~0_57, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_63, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_120, ~z$w_buff1~0=v_~z$w_buff1~0_70, ~z$flush_delayed~0=v_~z$flush_delayed~0_23, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z~0=v_~z~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_38} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][173], [P1Thread1of1ForFork0InUse, 34#L754true, 51#L3true, 24#L807true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 41#L774true, 118#true, 144#true, 121#true, 178#(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))]) [2022-12-06 16:32:48,471 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:32:48,471 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:48,471 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:48,471 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:48,472 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_121 256) 0))) (.cse2 (not (= (mod v_~z$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_122 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~z$w_buff1_used~0_101 256) 0)))) (.cse4 (and .cse3 .cse5))) (and (= v_~z~0_60 (ite .cse0 v_~z$w_buff0~0_43 (ite .cse1 v_~z$w_buff1~0_56 v_~z~0_61))) (= v_~z$w_buff0_used~0_121 (ite .cse0 0 v_~z$w_buff0_used~0_122)) (= v_~z$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_100 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd2~0_25 256) 0)))) 0 v_~z$r_buff1_thd2~0_24)) (= v_~z$r_buff0_thd2~0_25 (ite .cse4 0 v_~z$r_buff0_thd2~0_26)) (= v_~z$w_buff1_used~0_100 (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_101))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_122, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$w_buff1~0=v_~z$w_buff1~0_56, ~z~0=v_~z~0_61, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_121, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, ~z$w_buff1~0=v_~z$w_buff1~0_56, ~z~0=v_~z~0_60, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0][174], [P1Thread1of1ForFork0InUse, 34#L754true, 51#L3true, P2Thread1of1ForFork1InUse, 124#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), 147#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), P0Thread1of1ForFork2InUse, 78#L781true, 70#L791true, 118#true, 178#(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))]) [2022-12-06 16:32:48,472 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:32:48,472 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:48,472 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:48,472 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:48,474 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([338] L791-->L807: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_64 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and .cse10 .cse7)) (.cse11 (= (mod v_~z$w_buff0_used~0_142 256) 0)) (.cse2 (and (= (mod v_~z$w_buff1_used~0_121 256) 0) .cse7))) (let ((.cse6 (= (mod v_~z$w_buff1_used~0_120 256) 0)) (.cse3 (= (mod v_~z$w_buff0_used~0_141 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse4 (or .cse1 .cse11 .cse2)) (.cse5 (and .cse8 (not .cse11)))) (and (= v_~z$w_buff1_used~0_120 (ite .cse0 v_~z$w_buff1_used~0_121 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_121 0))) (= |v_P2Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse4 v_~z~0_85 (ite .cse5 v_~z$w_buff0~0_58 v_~z$w_buff1~0_71)) v_~__unbuffered_p2_EAX~0_16) (= |v_P2Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_38) (= v_~z$w_buff1~0_70 v_~z$w_buff1~0_71) (= v_~z~0_84 (ite .cse0 v_~z$mem_tmp~0_14 v_~__unbuffered_p2_EAX~0_16)) (= v_~z$w_buff0~0_58 v_~z$w_buff0~0_57) (= v_~z$flush_delayed~0_23 0) (= v_~z$r_buff0_thd3~0_67 (ite .cse0 v_~z$r_buff0_thd3~0_68 (ite (or .cse1 (and .cse6 .cse7) .cse3) v_~z$r_buff0_thd3~0_68 (ite (and .cse8 (not .cse3)) 0 v_~z$r_buff0_thd3~0_68)))) (= (ite .cse0 v_~z$r_buff1_thd3~0_64 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_67 256) 0))) (or (and .cse6 .cse9) .cse3 (and .cse10 .cse9))) v_~z$r_buff1_thd3~0_64 0)) v_~z$r_buff1_thd3~0_63) (= v_~z$w_buff0_used~0_141 (ite .cse0 v_~z$w_buff0_used~0_142 (ite .cse4 v_~z$w_buff0_used~0_142 (ite .cse5 0 v_~z$w_buff0_used~0_142)))) (= v_~z$mem_tmp~0_14 v_~z~0_85))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_142, ~z$w_buff0~0=v_~z$w_buff0~0_58, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_64, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_121, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~z$w_buff1~0=v_~z$w_buff1~0_71, ~z~0=v_~z~0_85, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_141, ~z$w_buff0~0=v_~z$w_buff0~0_57, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_63, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_120, ~z$w_buff1~0=v_~z$w_buff1~0_70, ~z$flush_delayed~0=v_~z$flush_delayed~0_23, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z~0=v_~z~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_38} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][173], [P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 106#L3-1true, 24#L807true, P0Thread1of1ForFork2InUse, 41#L774true, 46#L751true, 118#true, 144#true, 121#true, 178#(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))]) [2022-12-06 16:32:48,474 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:32:48,474 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:48,474 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:48,474 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:48,475 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_121 256) 0))) (.cse2 (not (= (mod v_~z$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_122 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~z$w_buff1_used~0_101 256) 0)))) (.cse4 (and .cse3 .cse5))) (and (= v_~z~0_60 (ite .cse0 v_~z$w_buff0~0_43 (ite .cse1 v_~z$w_buff1~0_56 v_~z~0_61))) (= v_~z$w_buff0_used~0_121 (ite .cse0 0 v_~z$w_buff0_used~0_122)) (= v_~z$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_100 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd2~0_25 256) 0)))) 0 v_~z$r_buff1_thd2~0_24)) (= v_~z$r_buff0_thd2~0_25 (ite .cse4 0 v_~z$r_buff0_thd2~0_26)) (= v_~z$w_buff1_used~0_100 (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_101))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_122, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$w_buff1~0=v_~z$w_buff1~0_56, ~z~0=v_~z~0_61, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_121, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, ~z$w_buff1~0=v_~z$w_buff1~0_56, ~z~0=v_~z~0_60, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0][174], [P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 106#L3-1true, 124#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), 147#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), P0Thread1of1ForFork2InUse, 78#L781true, 70#L791true, 46#L751true, 118#true, 178#(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))]) [2022-12-06 16:32:48,475 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:32:48,475 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:48,475 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:48,475 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:48,556 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([325] L754-->L761: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_31 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse0 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_125 256) 0)))) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_146 256) 0)) .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_125) v_~z$w_buff1_used~0_124) (= v_~z$r_buff0_thd1~0_30 (ite .cse1 0 v_~z$r_buff0_thd1~0_31)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd1~0_30 256) 0)) .cse2) (and (not (= (mod v_~z$w_buff1_used~0_124 256) 0)) .cse3)) 0 v_~z$r_buff1_thd1~0_20) v_~z$r_buff1_thd1~0_19) (= v_~z~0_88 (ite .cse4 v_~z$w_buff0~0_61 (ite .cse0 v_~z$w_buff1~0_74 v_~z~0_89))) (= v_~z$w_buff0_used~0_145 (ite .cse4 0 v_~z$w_buff0_used~0_146))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_146, ~z$w_buff0~0=v_~z$w_buff0~0_61, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_125, ~z$w_buff1~0=v_~z$w_buff1~0_74, ~z~0=v_~z~0_89, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_31} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_145, ~z$w_buff0~0=v_~z$w_buff0~0_61, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_124, ~z$w_buff1~0=v_~z$w_buff1~0_74, ~z~0=v_~z~0_88, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_30} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][175], [P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 106#L3-1true, 124#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), 147#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), P0Thread1of1ForFork2InUse, 85#L761true, 41#L774true, 70#L791true, 118#true, 178#(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))]) [2022-12-06 16:32:48,556 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:32:48,556 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:32:48,556 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:32:48,556 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:32:48,557 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([338] L791-->L807: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_64 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and .cse10 .cse7)) (.cse11 (= (mod v_~z$w_buff0_used~0_142 256) 0)) (.cse2 (and (= (mod v_~z$w_buff1_used~0_121 256) 0) .cse7))) (let ((.cse6 (= (mod v_~z$w_buff1_used~0_120 256) 0)) (.cse3 (= (mod v_~z$w_buff0_used~0_141 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse4 (or .cse1 .cse11 .cse2)) (.cse5 (and .cse8 (not .cse11)))) (and (= v_~z$w_buff1_used~0_120 (ite .cse0 v_~z$w_buff1_used~0_121 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_121 0))) (= |v_P2Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse4 v_~z~0_85 (ite .cse5 v_~z$w_buff0~0_58 v_~z$w_buff1~0_71)) v_~__unbuffered_p2_EAX~0_16) (= |v_P2Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_38) (= v_~z$w_buff1~0_70 v_~z$w_buff1~0_71) (= v_~z~0_84 (ite .cse0 v_~z$mem_tmp~0_14 v_~__unbuffered_p2_EAX~0_16)) (= v_~z$w_buff0~0_58 v_~z$w_buff0~0_57) (= v_~z$flush_delayed~0_23 0) (= v_~z$r_buff0_thd3~0_67 (ite .cse0 v_~z$r_buff0_thd3~0_68 (ite (or .cse1 (and .cse6 .cse7) .cse3) v_~z$r_buff0_thd3~0_68 (ite (and .cse8 (not .cse3)) 0 v_~z$r_buff0_thd3~0_68)))) (= (ite .cse0 v_~z$r_buff1_thd3~0_64 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_67 256) 0))) (or (and .cse6 .cse9) .cse3 (and .cse10 .cse9))) v_~z$r_buff1_thd3~0_64 0)) v_~z$r_buff1_thd3~0_63) (= v_~z$w_buff0_used~0_141 (ite .cse0 v_~z$w_buff0_used~0_142 (ite .cse4 v_~z$w_buff0_used~0_142 (ite .cse5 0 v_~z$w_buff0_used~0_142)))) (= v_~z$mem_tmp~0_14 v_~z~0_85))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_142, ~z$w_buff0~0=v_~z$w_buff0~0_58, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_64, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_121, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~z$w_buff1~0=v_~z$w_buff1~0_71, ~z~0=v_~z~0_85, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_141, ~z$w_buff0~0=v_~z$w_buff0~0_57, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_63, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_120, ~z$w_buff1~0=v_~z$w_buff1~0_70, ~z$flush_delayed~0=v_~z$flush_delayed~0_23, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z~0=v_~z~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_38} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][173], [P1Thread1of1ForFork0InUse, 34#L754true, 24#L807true, P2Thread1of1ForFork1InUse, 106#L3-1true, P0Thread1of1ForFork2InUse, 41#L774true, 118#true, 144#true, 121#true, 178#(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))]) [2022-12-06 16:32:48,558 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:32:48,558 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:32:48,558 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:32:48,558 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:32:48,558 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_121 256) 0))) (.cse2 (not (= (mod v_~z$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_122 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~z$w_buff1_used~0_101 256) 0)))) (.cse4 (and .cse3 .cse5))) (and (= v_~z~0_60 (ite .cse0 v_~z$w_buff0~0_43 (ite .cse1 v_~z$w_buff1~0_56 v_~z~0_61))) (= v_~z$w_buff0_used~0_121 (ite .cse0 0 v_~z$w_buff0_used~0_122)) (= v_~z$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_100 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd2~0_25 256) 0)))) 0 v_~z$r_buff1_thd2~0_24)) (= v_~z$r_buff0_thd2~0_25 (ite .cse4 0 v_~z$r_buff0_thd2~0_26)) (= v_~z$w_buff1_used~0_100 (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_101))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_122, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$w_buff1~0=v_~z$w_buff1~0_56, ~z~0=v_~z~0_61, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_121, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, ~z$w_buff1~0=v_~z$w_buff1~0_56, ~z~0=v_~z~0_60, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0][174], [P1Thread1of1ForFork0InUse, 34#L754true, P2Thread1of1ForFork1InUse, 106#L3-1true, 124#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), 147#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), P0Thread1of1ForFork2InUse, 78#L781true, 70#L791true, 118#true, 178#(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))]) [2022-12-06 16:32:48,558 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:32:48,558 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:32:48,558 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:32:48,558 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:32:49,157 INFO L130 PetriNetUnfolder]: 4859/10698 cut-off events. [2022-12-06 16:32:49,158 INFO L131 PetriNetUnfolder]: For 15774/17643 co-relation queries the response was YES. [2022-12-06 16:32:49,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31036 conditions, 10698 events. 4859/10698 cut-off events. For 15774/17643 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 95492 event pairs, 130 based on Foata normal form. 260/10606 useless extension candidates. Maximal degree in co-relation 30972. Up to 3218 conditions per place. [2022-12-06 16:32:49,285 INFO L137 encePairwiseOnDemand]: 97/107 looper letters, 155 selfloop transitions, 17 changer transitions 196/521 dead transitions. [2022-12-06 16:32:49,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 521 transitions, 3902 flow [2022-12-06 16:32:49,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 16:32:49,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 16:32:49,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 919 transitions. [2022-12-06 16:32:49,288 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8588785046728972 [2022-12-06 16:32:49,290 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 33 predicate places. [2022-12-06 16:32:49,290 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 521 transitions, 3902 flow [2022-12-06 16:32:49,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 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:32:49,290 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:32:49,290 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] [2022-12-06 16:32:49,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 16:32:49,292 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:32:49,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:32:49,292 INFO L85 PathProgramCache]: Analyzing trace with hash -102362613, now seen corresponding path program 1 times [2022-12-06 16:32:49,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:32:49,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425519568] [2022-12-06 16:32:49,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:32:49,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:32:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:32:49,473 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:32:49,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:32:49,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425519568] [2022-12-06 16:32:49,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425519568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:32:49,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:32:49,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:32:49,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769322726] [2022-12-06 16:32:49,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:32:49,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:32:49,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:32:49,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:32:49,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:32:49,475 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 107 [2022-12-06 16:32:49,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 521 transitions, 3902 flow. Second operand has 6 states, 6 states have (on average 86.33333333333333) internal successors, (518), 6 states have internal predecessors, (518), 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:32:49,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:32:49,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 107 [2022-12-06 16:32:49,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:32:49,738 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_121 256) 0))) (.cse2 (not (= (mod v_~z$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_122 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~z$w_buff1_used~0_101 256) 0)))) (.cse4 (and .cse3 .cse5))) (and (= v_~z~0_60 (ite .cse0 v_~z$w_buff0~0_43 (ite .cse1 v_~z$w_buff1~0_56 v_~z~0_61))) (= v_~z$w_buff0_used~0_121 (ite .cse0 0 v_~z$w_buff0_used~0_122)) (= v_~z$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_100 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd2~0_25 256) 0)))) 0 v_~z$r_buff1_thd2~0_24)) (= v_~z$r_buff0_thd2~0_25 (ite .cse4 0 v_~z$r_buff0_thd2~0_26)) (= v_~z$w_buff1_used~0_100 (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_101))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_122, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$w_buff1~0=v_~z$w_buff1~0_56, ~z~0=v_~z~0_61, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_121, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, ~z$w_buff1~0=v_~z$w_buff1~0_56, ~z~0=v_~z~0_60, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0][171], [P1Thread1of1ForFork0InUse, 183#true, P2Thread1of1ForFork1InUse, 124#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), 147#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), P0Thread1of1ForFork2InUse, 78#L781true, 63#L2true, 70#L791true, 46#L751true, 118#true, 176#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:32:49,738 INFO L382 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-12-06 16:32:49,738 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 16:32:49,738 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 16:32:49,738 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 16:32:49,739 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([338] L791-->L807: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_64 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and .cse10 .cse7)) (.cse11 (= (mod v_~z$w_buff0_used~0_142 256) 0)) (.cse2 (and (= (mod v_~z$w_buff1_used~0_121 256) 0) .cse7))) (let ((.cse6 (= (mod v_~z$w_buff1_used~0_120 256) 0)) (.cse3 (= (mod v_~z$w_buff0_used~0_141 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse4 (or .cse1 .cse11 .cse2)) (.cse5 (and .cse8 (not .cse11)))) (and (= v_~z$w_buff1_used~0_120 (ite .cse0 v_~z$w_buff1_used~0_121 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_121 0))) (= |v_P2Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse4 v_~z~0_85 (ite .cse5 v_~z$w_buff0~0_58 v_~z$w_buff1~0_71)) v_~__unbuffered_p2_EAX~0_16) (= |v_P2Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_38) (= v_~z$w_buff1~0_70 v_~z$w_buff1~0_71) (= v_~z~0_84 (ite .cse0 v_~z$mem_tmp~0_14 v_~__unbuffered_p2_EAX~0_16)) (= v_~z$w_buff0~0_58 v_~z$w_buff0~0_57) (= v_~z$flush_delayed~0_23 0) (= v_~z$r_buff0_thd3~0_67 (ite .cse0 v_~z$r_buff0_thd3~0_68 (ite (or .cse1 (and .cse6 .cse7) .cse3) v_~z$r_buff0_thd3~0_68 (ite (and .cse8 (not .cse3)) 0 v_~z$r_buff0_thd3~0_68)))) (= (ite .cse0 v_~z$r_buff1_thd3~0_64 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_67 256) 0))) (or (and .cse6 .cse9) .cse3 (and .cse10 .cse9))) v_~z$r_buff1_thd3~0_64 0)) v_~z$r_buff1_thd3~0_63) (= v_~z$w_buff0_used~0_141 (ite .cse0 v_~z$w_buff0_used~0_142 (ite .cse4 v_~z$w_buff0_used~0_142 (ite .cse5 0 v_~z$w_buff0_used~0_142)))) (= v_~z$mem_tmp~0_14 v_~z~0_85))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_142, ~z$w_buff0~0=v_~z$w_buff0~0_58, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_64, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_121, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~z$w_buff1~0=v_~z$w_buff1~0_71, ~z~0=v_~z~0_85, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_141, ~z$w_buff0~0=v_~z$w_buff0~0_57, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_63, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_120, ~z$w_buff1~0=v_~z$w_buff1~0_70, ~z$flush_delayed~0=v_~z$flush_delayed~0_23, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z~0=v_~z~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_38} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][172], [P1Thread1of1ForFork0InUse, 183#true, 24#L807true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 63#L2true, 41#L774true, 46#L751true, 118#true, 176#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 144#true, 121#true]) [2022-12-06 16:32:49,739 INFO L382 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-12-06 16:32:49,739 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 16:32:49,739 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 16:32:49,739 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 16:32:49,896 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([338] L791-->L807: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_64 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and .cse10 .cse7)) (.cse11 (= (mod v_~z$w_buff0_used~0_142 256) 0)) (.cse2 (and (= (mod v_~z$w_buff1_used~0_121 256) 0) .cse7))) (let ((.cse6 (= (mod v_~z$w_buff1_used~0_120 256) 0)) (.cse3 (= (mod v_~z$w_buff0_used~0_141 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse4 (or .cse1 .cse11 .cse2)) (.cse5 (and .cse8 (not .cse11)))) (and (= v_~z$w_buff1_used~0_120 (ite .cse0 v_~z$w_buff1_used~0_121 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_121 0))) (= |v_P2Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse4 v_~z~0_85 (ite .cse5 v_~z$w_buff0~0_58 v_~z$w_buff1~0_71)) v_~__unbuffered_p2_EAX~0_16) (= |v_P2Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_38) (= v_~z$w_buff1~0_70 v_~z$w_buff1~0_71) (= v_~z~0_84 (ite .cse0 v_~z$mem_tmp~0_14 v_~__unbuffered_p2_EAX~0_16)) (= v_~z$w_buff0~0_58 v_~z$w_buff0~0_57) (= v_~z$flush_delayed~0_23 0) (= v_~z$r_buff0_thd3~0_67 (ite .cse0 v_~z$r_buff0_thd3~0_68 (ite (or .cse1 (and .cse6 .cse7) .cse3) v_~z$r_buff0_thd3~0_68 (ite (and .cse8 (not .cse3)) 0 v_~z$r_buff0_thd3~0_68)))) (= (ite .cse0 v_~z$r_buff1_thd3~0_64 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_67 256) 0))) (or (and .cse6 .cse9) .cse3 (and .cse10 .cse9))) v_~z$r_buff1_thd3~0_64 0)) v_~z$r_buff1_thd3~0_63) (= v_~z$w_buff0_used~0_141 (ite .cse0 v_~z$w_buff0_used~0_142 (ite .cse4 v_~z$w_buff0_used~0_142 (ite .cse5 0 v_~z$w_buff0_used~0_142)))) (= v_~z$mem_tmp~0_14 v_~z~0_85))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_142, ~z$w_buff0~0=v_~z$w_buff0~0_58, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_64, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_121, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~z$w_buff1~0=v_~z$w_buff1~0_71, ~z~0=v_~z~0_85, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_141, ~z$w_buff0~0=v_~z$w_buff0~0_57, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_63, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_120, ~z$w_buff1~0=v_~z$w_buff1~0_70, ~z$flush_delayed~0=v_~z$flush_delayed~0_23, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z~0=v_~z~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_38} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][147], [P1Thread1of1ForFork0InUse, 34#L754true, 24#L807true, P2Thread1of1ForFork1InUse, 185#(= ~x~0 1), P0Thread1of1ForFork2InUse, 63#L2true, 41#L774true, 118#true, 176#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 144#true, 121#true]) [2022-12-06 16:32:49,896 INFO L382 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-12-06 16:32:49,896 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:32:49,896 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:32:49,897 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:32:49,898 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([338] L791-->L807: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_64 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and .cse10 .cse7)) (.cse11 (= (mod v_~z$w_buff0_used~0_142 256) 0)) (.cse2 (and (= (mod v_~z$w_buff1_used~0_121 256) 0) .cse7))) (let ((.cse6 (= (mod v_~z$w_buff1_used~0_120 256) 0)) (.cse3 (= (mod v_~z$w_buff0_used~0_141 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse4 (or .cse1 .cse11 .cse2)) (.cse5 (and .cse8 (not .cse11)))) (and (= v_~z$w_buff1_used~0_120 (ite .cse0 v_~z$w_buff1_used~0_121 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_121 0))) (= |v_P2Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse4 v_~z~0_85 (ite .cse5 v_~z$w_buff0~0_58 v_~z$w_buff1~0_71)) v_~__unbuffered_p2_EAX~0_16) (= |v_P2Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_38) (= v_~z$w_buff1~0_70 v_~z$w_buff1~0_71) (= v_~z~0_84 (ite .cse0 v_~z$mem_tmp~0_14 v_~__unbuffered_p2_EAX~0_16)) (= v_~z$w_buff0~0_58 v_~z$w_buff0~0_57) (= v_~z$flush_delayed~0_23 0) (= v_~z$r_buff0_thd3~0_67 (ite .cse0 v_~z$r_buff0_thd3~0_68 (ite (or .cse1 (and .cse6 .cse7) .cse3) v_~z$r_buff0_thd3~0_68 (ite (and .cse8 (not .cse3)) 0 v_~z$r_buff0_thd3~0_68)))) (= (ite .cse0 v_~z$r_buff1_thd3~0_64 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_67 256) 0))) (or (and .cse6 .cse9) .cse3 (and .cse10 .cse9))) v_~z$r_buff1_thd3~0_64 0)) v_~z$r_buff1_thd3~0_63) (= v_~z$w_buff0_used~0_141 (ite .cse0 v_~z$w_buff0_used~0_142 (ite .cse4 v_~z$w_buff0_used~0_142 (ite .cse5 0 v_~z$w_buff0_used~0_142)))) (= v_~z$mem_tmp~0_14 v_~z~0_85))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_142, ~z$w_buff0~0=v_~z$w_buff0~0_58, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_64, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_121, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~z$w_buff1~0=v_~z$w_buff1~0_71, ~z~0=v_~z~0_85, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_141, ~z$w_buff0~0=v_~z$w_buff0~0_57, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_63, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_120, ~z$w_buff1~0=v_~z$w_buff1~0_70, ~z$flush_delayed~0=v_~z$flush_delayed~0_23, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z~0=v_~z~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_38} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][195], [P1Thread1of1ForFork0InUse, 183#true, 51#L3true, 24#L807true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 41#L774true, 46#L751true, 118#true, 144#true, 121#true, 178#(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))]) [2022-12-06 16:32:49,898 INFO L382 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-12-06 16:32:49,898 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:32:49,898 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:32:49,898 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:32:49,899 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([338] L791-->L807: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_64 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and .cse10 .cse7)) (.cse11 (= (mod v_~z$w_buff0_used~0_142 256) 0)) (.cse2 (and (= (mod v_~z$w_buff1_used~0_121 256) 0) .cse7))) (let ((.cse6 (= (mod v_~z$w_buff1_used~0_120 256) 0)) (.cse3 (= (mod v_~z$w_buff0_used~0_141 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse4 (or .cse1 .cse11 .cse2)) (.cse5 (and .cse8 (not .cse11)))) (and (= v_~z$w_buff1_used~0_120 (ite .cse0 v_~z$w_buff1_used~0_121 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_121 0))) (= |v_P2Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse4 v_~z~0_85 (ite .cse5 v_~z$w_buff0~0_58 v_~z$w_buff1~0_71)) v_~__unbuffered_p2_EAX~0_16) (= |v_P2Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_38) (= v_~z$w_buff1~0_70 v_~z$w_buff1~0_71) (= v_~z~0_84 (ite .cse0 v_~z$mem_tmp~0_14 v_~__unbuffered_p2_EAX~0_16)) (= v_~z$w_buff0~0_58 v_~z$w_buff0~0_57) (= v_~z$flush_delayed~0_23 0) (= v_~z$r_buff0_thd3~0_67 (ite .cse0 v_~z$r_buff0_thd3~0_68 (ite (or .cse1 (and .cse6 .cse7) .cse3) v_~z$r_buff0_thd3~0_68 (ite (and .cse8 (not .cse3)) 0 v_~z$r_buff0_thd3~0_68)))) (= (ite .cse0 v_~z$r_buff1_thd3~0_64 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_67 256) 0))) (or (and .cse6 .cse9) .cse3 (and .cse10 .cse9))) v_~z$r_buff1_thd3~0_64 0)) v_~z$r_buff1_thd3~0_63) (= v_~z$w_buff0_used~0_141 (ite .cse0 v_~z$w_buff0_used~0_142 (ite .cse4 v_~z$w_buff0_used~0_142 (ite .cse5 0 v_~z$w_buff0_used~0_142)))) (= v_~z$mem_tmp~0_14 v_~z~0_85))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_142, ~z$w_buff0~0=v_~z$w_buff0~0_58, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_64, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_121, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~z$w_buff1~0=v_~z$w_buff1~0_71, ~z~0=v_~z~0_85, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_141, ~z$w_buff0~0=v_~z$w_buff0~0_57, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_63, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_120, ~z$w_buff1~0=v_~z$w_buff1~0_70, ~z$flush_delayed~0=v_~z$flush_delayed~0_23, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z~0=v_~z~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_38} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][196], [P1Thread1of1ForFork0InUse, 51#L3true, 34#L754true, 24#L807true, P2Thread1of1ForFork1InUse, 185#(= ~x~0 1), P0Thread1of1ForFork2InUse, 41#L774true, 118#true, 144#true, 121#true, 178#(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))]) [2022-12-06 16:32:49,899 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:32:49,899 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:49,899 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:49,899 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:49,899 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_121 256) 0))) (.cse2 (not (= (mod v_~z$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_122 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~z$w_buff1_used~0_101 256) 0)))) (.cse4 (and .cse3 .cse5))) (and (= v_~z~0_60 (ite .cse0 v_~z$w_buff0~0_43 (ite .cse1 v_~z$w_buff1~0_56 v_~z~0_61))) (= v_~z$w_buff0_used~0_121 (ite .cse0 0 v_~z$w_buff0_used~0_122)) (= v_~z$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_100 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd2~0_25 256) 0)))) 0 v_~z$r_buff1_thd2~0_24)) (= v_~z$r_buff0_thd2~0_25 (ite .cse4 0 v_~z$r_buff0_thd2~0_26)) (= v_~z$w_buff1_used~0_100 (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_101))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_122, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$w_buff1~0=v_~z$w_buff1~0_56, ~z~0=v_~z~0_61, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_121, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, ~z$w_buff1~0=v_~z$w_buff1~0_56, ~z~0=v_~z~0_60, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0][199], [P1Thread1of1ForFork0InUse, 183#true, 51#L3true, P2Thread1of1ForFork1InUse, 124#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), 147#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), P0Thread1of1ForFork2InUse, 78#L781true, 70#L791true, 46#L751true, 118#true, 178#(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))]) [2022-12-06 16:32:49,899 INFO L382 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-12-06 16:32:49,900 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:32:49,900 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:32:49,900 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:32:49,973 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([325] L754-->L761: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_31 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse0 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_125 256) 0)))) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_146 256) 0)) .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_125) v_~z$w_buff1_used~0_124) (= v_~z$r_buff0_thd1~0_30 (ite .cse1 0 v_~z$r_buff0_thd1~0_31)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd1~0_30 256) 0)) .cse2) (and (not (= (mod v_~z$w_buff1_used~0_124 256) 0)) .cse3)) 0 v_~z$r_buff1_thd1~0_20) v_~z$r_buff1_thd1~0_19) (= v_~z~0_88 (ite .cse4 v_~z$w_buff0~0_61 (ite .cse0 v_~z$w_buff1~0_74 v_~z~0_89))) (= v_~z$w_buff0_used~0_145 (ite .cse4 0 v_~z$w_buff0_used~0_146))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_146, ~z$w_buff0~0=v_~z$w_buff0~0_61, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_125, ~z$w_buff1~0=v_~z$w_buff1~0_74, ~z~0=v_~z~0_89, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_31} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_145, ~z$w_buff0~0=v_~z$w_buff0~0_61, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_124, ~z$w_buff1~0=v_~z$w_buff1~0_74, ~z~0=v_~z~0_88, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_30} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][149], [P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 124#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), 147#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), 185#(= ~x~0 1), P0Thread1of1ForFork2InUse, 85#L761true, 41#L774true, 70#L791true, 63#L2true, 118#true, 176#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:32:49,973 INFO L382 tUnfolder$Statistics]: this new event has 67 ancestors and is not cut-off event [2022-12-06 16:32:49,974 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2022-12-06 16:32:49,974 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2022-12-06 16:32:49,974 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2022-12-06 16:32:49,974 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([325] L754-->L761: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_31 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse0 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_125 256) 0)))) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_146 256) 0)) .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_125) v_~z$w_buff1_used~0_124) (= v_~z$r_buff0_thd1~0_30 (ite .cse1 0 v_~z$r_buff0_thd1~0_31)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd1~0_30 256) 0)) .cse2) (and (not (= (mod v_~z$w_buff1_used~0_124 256) 0)) .cse3)) 0 v_~z$r_buff1_thd1~0_20) v_~z$r_buff1_thd1~0_19) (= v_~z~0_88 (ite .cse4 v_~z$w_buff0~0_61 (ite .cse0 v_~z$w_buff1~0_74 v_~z~0_89))) (= v_~z$w_buff0_used~0_145 (ite .cse4 0 v_~z$w_buff0_used~0_146))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_146, ~z$w_buff0~0=v_~z$w_buff0~0_61, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_125, ~z$w_buff1~0=v_~z$w_buff1~0_74, ~z~0=v_~z~0_89, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_31} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_145, ~z$w_buff0~0=v_~z$w_buff0~0_61, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_124, ~z$w_buff1~0=v_~z$w_buff1~0_74, ~z~0=v_~z~0_88, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_30} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][198], [P1Thread1of1ForFork0InUse, 51#L3true, P2Thread1of1ForFork1InUse, 124#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), 147#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), 185#(= ~x~0 1), P0Thread1of1ForFork2InUse, 85#L761true, 41#L774true, 70#L791true, 118#true, 178#(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))]) [2022-12-06 16:32:49,974 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:32:49,974 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:49,974 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:49,974 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:49,975 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_121 256) 0))) (.cse2 (not (= (mod v_~z$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_122 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~z$w_buff1_used~0_101 256) 0)))) (.cse4 (and .cse3 .cse5))) (and (= v_~z~0_60 (ite .cse0 v_~z$w_buff0~0_43 (ite .cse1 v_~z$w_buff1~0_56 v_~z~0_61))) (= v_~z$w_buff0_used~0_121 (ite .cse0 0 v_~z$w_buff0_used~0_122)) (= v_~z$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_100 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd2~0_25 256) 0)))) 0 v_~z$r_buff1_thd2~0_24)) (= v_~z$r_buff0_thd2~0_25 (ite .cse4 0 v_~z$r_buff0_thd2~0_26)) (= v_~z$w_buff1_used~0_100 (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_101))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_122, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$w_buff1~0=v_~z$w_buff1~0_56, ~z~0=v_~z~0_61, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_121, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, ~z$w_buff1~0=v_~z$w_buff1~0_56, ~z~0=v_~z~0_60, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0][225], [P1Thread1of1ForFork0InUse, 34#L754true, P2Thread1of1ForFork1InUse, 124#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), 147#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), 185#(= ~x~0 1), P0Thread1of1ForFork2InUse, 78#L781true, 63#L2true, 70#L791true, 118#true, 176#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:32:49,975 INFO L382 tUnfolder$Statistics]: this new event has 67 ancestors and is not cut-off event [2022-12-06 16:32:49,975 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2022-12-06 16:32:49,975 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2022-12-06 16:32:49,975 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2022-12-06 16:32:49,975 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_121 256) 0))) (.cse2 (not (= (mod v_~z$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_122 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~z$w_buff1_used~0_101 256) 0)))) (.cse4 (and .cse3 .cse5))) (and (= v_~z~0_60 (ite .cse0 v_~z$w_buff0~0_43 (ite .cse1 v_~z$w_buff1~0_56 v_~z~0_61))) (= v_~z$w_buff0_used~0_121 (ite .cse0 0 v_~z$w_buff0_used~0_122)) (= v_~z$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_100 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd2~0_25 256) 0)))) 0 v_~z$r_buff1_thd2~0_24)) (= v_~z$r_buff0_thd2~0_25 (ite .cse4 0 v_~z$r_buff0_thd2~0_26)) (= v_~z$w_buff1_used~0_100 (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_101))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_122, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$w_buff1~0=v_~z$w_buff1~0_56, ~z~0=v_~z~0_61, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_121, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, ~z$w_buff1~0=v_~z$w_buff1~0_56, ~z~0=v_~z~0_60, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0][266], [P1Thread1of1ForFork0InUse, 51#L3true, 34#L754true, P2Thread1of1ForFork1InUse, 124#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), 147#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), 185#(= ~x~0 1), P0Thread1of1ForFork2InUse, 78#L781true, 70#L791true, 118#true, 178#(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))]) [2022-12-06 16:32:49,975 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:32:49,975 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:49,975 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:49,976 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:49,991 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([338] L791-->L807: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_64 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and .cse10 .cse7)) (.cse11 (= (mod v_~z$w_buff0_used~0_142 256) 0)) (.cse2 (and (= (mod v_~z$w_buff1_used~0_121 256) 0) .cse7))) (let ((.cse6 (= (mod v_~z$w_buff1_used~0_120 256) 0)) (.cse3 (= (mod v_~z$w_buff0_used~0_141 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse4 (or .cse1 .cse11 .cse2)) (.cse5 (and .cse8 (not .cse11)))) (and (= v_~z$w_buff1_used~0_120 (ite .cse0 v_~z$w_buff1_used~0_121 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_121 0))) (= |v_P2Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse4 v_~z~0_85 (ite .cse5 v_~z$w_buff0~0_58 v_~z$w_buff1~0_71)) v_~__unbuffered_p2_EAX~0_16) (= |v_P2Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_38) (= v_~z$w_buff1~0_70 v_~z$w_buff1~0_71) (= v_~z~0_84 (ite .cse0 v_~z$mem_tmp~0_14 v_~__unbuffered_p2_EAX~0_16)) (= v_~z$w_buff0~0_58 v_~z$w_buff0~0_57) (= v_~z$flush_delayed~0_23 0) (= v_~z$r_buff0_thd3~0_67 (ite .cse0 v_~z$r_buff0_thd3~0_68 (ite (or .cse1 (and .cse6 .cse7) .cse3) v_~z$r_buff0_thd3~0_68 (ite (and .cse8 (not .cse3)) 0 v_~z$r_buff0_thd3~0_68)))) (= (ite .cse0 v_~z$r_buff1_thd3~0_64 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_67 256) 0))) (or (and .cse6 .cse9) .cse3 (and .cse10 .cse9))) v_~z$r_buff1_thd3~0_64 0)) v_~z$r_buff1_thd3~0_63) (= v_~z$w_buff0_used~0_141 (ite .cse0 v_~z$w_buff0_used~0_142 (ite .cse4 v_~z$w_buff0_used~0_142 (ite .cse5 0 v_~z$w_buff0_used~0_142)))) (= v_~z$mem_tmp~0_14 v_~z~0_85))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_142, ~z$w_buff0~0=v_~z$w_buff0~0_58, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_64, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_121, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~z$w_buff1~0=v_~z$w_buff1~0_71, ~z~0=v_~z~0_85, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_141, ~z$w_buff0~0=v_~z$w_buff0~0_57, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_63, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_120, ~z$w_buff1~0=v_~z$w_buff1~0_70, ~z$flush_delayed~0=v_~z$flush_delayed~0_23, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z~0=v_~z~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_38} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][195], [P1Thread1of1ForFork0InUse, 183#true, 24#L807true, P2Thread1of1ForFork1InUse, 106#L3-1true, P0Thread1of1ForFork2InUse, 41#L774true, 46#L751true, 118#true, 144#true, 121#true, 178#(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))]) [2022-12-06 16:32:49,991 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:32:49,991 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:49,991 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:49,991 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:49,992 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([338] L791-->L807: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_64 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and .cse10 .cse7)) (.cse11 (= (mod v_~z$w_buff0_used~0_142 256) 0)) (.cse2 (and (= (mod v_~z$w_buff1_used~0_121 256) 0) .cse7))) (let ((.cse6 (= (mod v_~z$w_buff1_used~0_120 256) 0)) (.cse3 (= (mod v_~z$w_buff0_used~0_141 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse4 (or .cse1 .cse11 .cse2)) (.cse5 (and .cse8 (not .cse11)))) (and (= v_~z$w_buff1_used~0_120 (ite .cse0 v_~z$w_buff1_used~0_121 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_121 0))) (= |v_P2Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse4 v_~z~0_85 (ite .cse5 v_~z$w_buff0~0_58 v_~z$w_buff1~0_71)) v_~__unbuffered_p2_EAX~0_16) (= |v_P2Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_38) (= v_~z$w_buff1~0_70 v_~z$w_buff1~0_71) (= v_~z~0_84 (ite .cse0 v_~z$mem_tmp~0_14 v_~__unbuffered_p2_EAX~0_16)) (= v_~z$w_buff0~0_58 v_~z$w_buff0~0_57) (= v_~z$flush_delayed~0_23 0) (= v_~z$r_buff0_thd3~0_67 (ite .cse0 v_~z$r_buff0_thd3~0_68 (ite (or .cse1 (and .cse6 .cse7) .cse3) v_~z$r_buff0_thd3~0_68 (ite (and .cse8 (not .cse3)) 0 v_~z$r_buff0_thd3~0_68)))) (= (ite .cse0 v_~z$r_buff1_thd3~0_64 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_67 256) 0))) (or (and .cse6 .cse9) .cse3 (and .cse10 .cse9))) v_~z$r_buff1_thd3~0_64 0)) v_~z$r_buff1_thd3~0_63) (= v_~z$w_buff0_used~0_141 (ite .cse0 v_~z$w_buff0_used~0_142 (ite .cse4 v_~z$w_buff0_used~0_142 (ite .cse5 0 v_~z$w_buff0_used~0_142)))) (= v_~z$mem_tmp~0_14 v_~z~0_85))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_142, ~z$w_buff0~0=v_~z$w_buff0~0_58, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_64, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_121, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~z$w_buff1~0=v_~z$w_buff1~0_71, ~z~0=v_~z~0_85, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_141, ~z$w_buff0~0=v_~z$w_buff0~0_57, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_63, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_120, ~z$w_buff1~0=v_~z$w_buff1~0_70, ~z$flush_delayed~0=v_~z$flush_delayed~0_23, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z~0=v_~z~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_38} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][196], [P1Thread1of1ForFork0InUse, 34#L754true, 24#L807true, P2Thread1of1ForFork1InUse, 106#L3-1true, 185#(= ~x~0 1), P0Thread1of1ForFork2InUse, 41#L774true, 118#true, 144#true, 121#true, 178#(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))]) [2022-12-06 16:32:49,992 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:32:49,992 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:32:49,992 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:32:49,992 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:32:49,992 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_121 256) 0))) (.cse2 (not (= (mod v_~z$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_122 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~z$w_buff1_used~0_101 256) 0)))) (.cse4 (and .cse3 .cse5))) (and (= v_~z~0_60 (ite .cse0 v_~z$w_buff0~0_43 (ite .cse1 v_~z$w_buff1~0_56 v_~z~0_61))) (= v_~z$w_buff0_used~0_121 (ite .cse0 0 v_~z$w_buff0_used~0_122)) (= v_~z$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_100 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd2~0_25 256) 0)))) 0 v_~z$r_buff1_thd2~0_24)) (= v_~z$r_buff0_thd2~0_25 (ite .cse4 0 v_~z$r_buff0_thd2~0_26)) (= v_~z$w_buff1_used~0_100 (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_101))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_122, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$w_buff1~0=v_~z$w_buff1~0_56, ~z~0=v_~z~0_61, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_121, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, ~z$w_buff1~0=v_~z$w_buff1~0_56, ~z~0=v_~z~0_60, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0][199], [P1Thread1of1ForFork0InUse, 183#true, P2Thread1of1ForFork1InUse, 106#L3-1true, 124#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), 147#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), P0Thread1of1ForFork2InUse, 78#L781true, 70#L791true, 46#L751true, 118#true, 178#(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))]) [2022-12-06 16:32:49,992 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:32:49,992 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:49,992 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:49,992 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:32:50,077 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([325] L754-->L761: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_31 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse0 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_125 256) 0)))) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_146 256) 0)) .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_125) v_~z$w_buff1_used~0_124) (= v_~z$r_buff0_thd1~0_30 (ite .cse1 0 v_~z$r_buff0_thd1~0_31)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd1~0_30 256) 0)) .cse2) (and (not (= (mod v_~z$w_buff1_used~0_124 256) 0)) .cse3)) 0 v_~z$r_buff1_thd1~0_20) v_~z$r_buff1_thd1~0_19) (= v_~z~0_88 (ite .cse4 v_~z$w_buff0~0_61 (ite .cse0 v_~z$w_buff1~0_74 v_~z~0_89))) (= v_~z$w_buff0_used~0_145 (ite .cse4 0 v_~z$w_buff0_used~0_146))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_146, ~z$w_buff0~0=v_~z$w_buff0~0_61, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_125, ~z$w_buff1~0=v_~z$w_buff1~0_74, ~z~0=v_~z~0_89, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_31} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_145, ~z$w_buff0~0=v_~z$w_buff0~0_61, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_124, ~z$w_buff1~0=v_~z$w_buff1~0_74, ~z~0=v_~z~0_88, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_30} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][198], [P1Thread1of1ForFork0InUse, 106#L3-1true, P2Thread1of1ForFork1InUse, 124#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), 147#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), 185#(= ~x~0 1), P0Thread1of1ForFork2InUse, 85#L761true, 41#L774true, 70#L791true, 118#true, 178#(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))]) [2022-12-06 16:32:50,078 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:32:50,078 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:32:50,078 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:32:50,078 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:32:50,078 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_121 256) 0))) (.cse2 (not (= (mod v_~z$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_122 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~z$w_buff1_used~0_101 256) 0)))) (.cse4 (and .cse3 .cse5))) (and (= v_~z~0_60 (ite .cse0 v_~z$w_buff0~0_43 (ite .cse1 v_~z$w_buff1~0_56 v_~z~0_61))) (= v_~z$w_buff0_used~0_121 (ite .cse0 0 v_~z$w_buff0_used~0_122)) (= v_~z$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_100 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$r_buff0_thd2~0_25 256) 0)))) 0 v_~z$r_buff1_thd2~0_24)) (= v_~z$r_buff0_thd2~0_25 (ite .cse4 0 v_~z$r_buff0_thd2~0_26)) (= v_~z$w_buff1_used~0_100 (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_101))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_122, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$w_buff1~0=v_~z$w_buff1~0_56, ~z~0=v_~z~0_61, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_121, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, ~z$w_buff1~0=v_~z$w_buff1~0_56, ~z~0=v_~z~0_60, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0][266], [P1Thread1of1ForFork0InUse, 34#L754true, P2Thread1of1ForFork1InUse, 106#L3-1true, 124#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), 147#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0))), 185#(= ~x~0 1), P0Thread1of1ForFork2InUse, 78#L781true, 70#L791true, 118#true, 178#(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))]) [2022-12-06 16:32:50,078 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:32:50,078 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:32:50,079 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:32:50,079 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:32:51,471 INFO L130 PetriNetUnfolder]: 7655/17583 cut-off events. [2022-12-06 16:32:51,472 INFO L131 PetriNetUnfolder]: For 41276/45685 co-relation queries the response was YES. [2022-12-06 16:32:51,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58037 conditions, 17583 events. 7655/17583 cut-off events. For 41276/45685 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 176276 event pairs, 216 based on Foata normal form. 714/17830 useless extension candidates. Maximal degree in co-relation 57969. Up to 5420 conditions per place. [2022-12-06 16:32:51,534 INFO L137 encePairwiseOnDemand]: 101/107 looper letters, 208 selfloop transitions, 27 changer transitions 425/771 dead transitions. [2022-12-06 16:32:51,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 771 transitions, 7402 flow [2022-12-06 16:32:51,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 16:32:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 16:32:51,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 826 transitions. [2022-12-06 16:32:51,536 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.857736240913811 [2022-12-06 16:32:51,537 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 41 predicate places. [2022-12-06 16:32:51,537 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 771 transitions, 7402 flow [2022-12-06 16:32:51,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.33333333333333) internal successors, (518), 6 states have internal predecessors, (518), 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:32:51,537 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:32:51,537 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] [2022-12-06 16:32:51,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 16:32:51,538 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:32:51,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:32:51,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1178100493, now seen corresponding path program 1 times [2022-12-06 16:32:51,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:32:51,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522612944] [2022-12-06 16:32:51,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:32:51,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:32:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:32:51,664 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:32:51,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:32:51,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522612944] [2022-12-06 16:32:51,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522612944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:32:51,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:32:51,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:32:51,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781078920] [2022-12-06 16:32:51,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:32:51,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:32:51,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:32:51,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:32:51,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:32:51,666 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 107 [2022-12-06 16:32:51,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 771 transitions, 7402 flow. Second operand has 7 states, 7 states have (on average 84.85714285714286) internal successors, (594), 7 states have internal predecessors, (594), 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:32:51,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:32:51,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 107 [2022-12-06 16:32:51,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:32:53,080 INFO L130 PetriNetUnfolder]: 4994/10449 cut-off events. [2022-12-06 16:32:53,080 INFO L131 PetriNetUnfolder]: For 36315/41616 co-relation queries the response was YES. [2022-12-06 16:32:53,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41754 conditions, 10449 events. 4994/10449 cut-off events. For 36315/41616 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 92921 event pairs, 103 based on Foata normal form. 1125/11414 useless extension candidates. Maximal degree in co-relation 41682. Up to 3408 conditions per place. [2022-12-06 16:32:53,211 INFO L137 encePairwiseOnDemand]: 97/107 looper letters, 148 selfloop transitions, 28 changer transitions 507/781 dead transitions. [2022-12-06 16:32:53,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 781 transitions, 8852 flow [2022-12-06 16:32:53,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:32:53,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:32:53,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1198 transitions. [2022-12-06 16:32:53,224 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8612508986340762 [2022-12-06 16:32:53,225 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 47 predicate places. [2022-12-06 16:32:53,225 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 781 transitions, 8852 flow [2022-12-06 16:32:53,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.85714285714286) internal successors, (594), 7 states have internal predecessors, (594), 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:32:53,225 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:32:53,225 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:32:53,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 16:32:53,226 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:32:53,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:32:53,226 INFO L85 PathProgramCache]: Analyzing trace with hash 539470774, now seen corresponding path program 1 times [2022-12-06 16:32:53,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:32:53,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685202107] [2022-12-06 16:32:53,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:32:53,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:32:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:32:53,417 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:32:53,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:32:53,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685202107] [2022-12-06 16:32:53,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685202107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:32:53,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:32:53,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 16:32:53,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633638230] [2022-12-06 16:32:53,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:32:53,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 16:32:53,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:32:53,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 16:32:53,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 16:32:53,422 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 107 [2022-12-06 16:32:53,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 781 transitions, 8852 flow. Second operand has 8 states, 8 states have (on average 85.0) internal successors, (680), 8 states have internal predecessors, (680), 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:32:53,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:32:53,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 107 [2022-12-06 16:32:53,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:32:54,896 INFO L130 PetriNetUnfolder]: 4791/9334 cut-off events. [2022-12-06 16:32:54,896 INFO L131 PetriNetUnfolder]: For 37280/44191 co-relation queries the response was YES. [2022-12-06 16:32:54,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45754 conditions, 9334 events. 4791/9334 cut-off events. For 37280/44191 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 81019 event pairs, 104 based on Foata normal form. 1146/10302 useless extension candidates. Maximal degree in co-relation 45678. Up to 3243 conditions per place. [2022-12-06 16:32:54,921 INFO L137 encePairwiseOnDemand]: 97/107 looper letters, 58 selfloop transitions, 20 changer transitions 560/715 dead transitions. [2022-12-06 16:32:54,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 715 transitions, 9334 flow [2022-12-06 16:32:54,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 16:32:54,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 16:32:54,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1436 transitions. [2022-12-06 16:32:54,925 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8387850467289719 [2022-12-06 16:32:54,925 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 53 predicate places. [2022-12-06 16:32:54,925 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 715 transitions, 9334 flow [2022-12-06 16:32:54,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 85.0) internal successors, (680), 8 states have internal predecessors, (680), 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:32:54,926 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:32:54,926 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] [2022-12-06 16:32:54,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 16:32:54,926 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:32:54,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:32:54,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1923922767, now seen corresponding path program 1 times [2022-12-06 16:32:54,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:32:54,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813404791] [2022-12-06 16:32:54,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:32:54,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:32:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:32:55,654 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:32:55,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:32:55,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813404791] [2022-12-06 16:32:55,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813404791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:32:55,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:32:55,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-06 16:32:55,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587400583] [2022-12-06 16:32:55,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:32:55,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 16:32:55,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:32:55,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 16:32:55,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-06 16:32:55,657 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 107 [2022-12-06 16:32:55,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 715 transitions, 9334 flow. Second operand has 12 states, 12 states have (on average 79.08333333333333) internal successors, (949), 12 states have internal predecessors, (949), 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:32:55,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:32:55,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 107 [2022-12-06 16:32:55,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:32:57,190 INFO L130 PetriNetUnfolder]: 6014/12467 cut-off events. [2022-12-06 16:32:57,190 INFO L131 PetriNetUnfolder]: For 65904/70143 co-relation queries the response was YES. [2022-12-06 16:32:57,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61613 conditions, 12467 events. 6014/12467 cut-off events. For 65904/70143 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 119269 event pairs, 126 based on Foata normal form. 699/13011 useless extension candidates. Maximal degree in co-relation 61524. Up to 3743 conditions per place. [2022-12-06 16:32:57,215 INFO L137 encePairwiseOnDemand]: 96/107 looper letters, 38 selfloop transitions, 11 changer transitions 903/1034 dead transitions. [2022-12-06 16:32:57,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 1034 transitions, 15993 flow [2022-12-06 16:32:57,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 16:32:57,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 16:32:57,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 969 transitions. [2022-12-06 16:32:57,217 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7546728971962616 [2022-12-06 16:32:57,217 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 64 predicate places. [2022-12-06 16:32:57,217 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 1034 transitions, 15993 flow [2022-12-06 16:32:57,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 79.08333333333333) internal successors, (949), 12 states have internal predecessors, (949), 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:32:57,218 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:32:57,218 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] [2022-12-06 16:32:57,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 16:32:57,218 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:32:57,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:32:57,218 INFO L85 PathProgramCache]: Analyzing trace with hash 165050605, now seen corresponding path program 2 times [2022-12-06 16:32:57,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:32:57,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346362004] [2022-12-06 16:32:57,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:32:57,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:32:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:32:57,252 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 16:32:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:32:57,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 16:32:57,296 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 16:32:57,297 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 16:32:57,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 16:32:57,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 16:32:57,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 16:32:57,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 16:32:57,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 16:32:57,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 16:32:57,299 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:32:57,303 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 16:32:57,303 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 16:32:57,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:32:57 BasicIcfg [2022-12-06 16:32:57,360 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 16:32:57,360 INFO L158 Benchmark]: Toolchain (without parser) took 14462.35ms. Allocated memory was 194.0MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 170.1MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 498.7MB. Max. memory is 8.0GB. [2022-12-06 16:32:57,360 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 194.0MB. Free memory is still 171.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 16:32:57,360 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.52ms. Allocated memory is still 194.0MB. Free memory was 169.7MB in the beginning and 143.5MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 16:32:57,360 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.40ms. Allocated memory is still 194.0MB. Free memory was 143.5MB in the beginning and 141.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 16:32:57,361 INFO L158 Benchmark]: Boogie Preprocessor took 42.52ms. Allocated memory is still 194.0MB. Free memory was 141.4MB in the beginning and 139.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 16:32:57,361 INFO L158 Benchmark]: RCFGBuilder took 594.26ms. Allocated memory is still 194.0MB. Free memory was 139.3MB in the beginning and 104.2MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-06 16:32:57,361 INFO L158 Benchmark]: TraceAbstraction took 13327.47ms. Allocated memory was 194.0MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 103.1MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 431.6MB. Max. memory is 8.0GB. [2022-12-06 16:32:57,362 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 194.0MB. Free memory is still 171.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 449.52ms. Allocated memory is still 194.0MB. Free memory was 169.7MB in the beginning and 143.5MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.40ms. Allocated memory is still 194.0MB. Free memory was 143.5MB in the beginning and 141.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.52ms. Allocated memory is still 194.0MB. Free memory was 141.4MB in the beginning and 139.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 594.26ms. Allocated memory is still 194.0MB. Free memory was 139.3MB in the beginning and 104.2MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 13327.47ms. Allocated memory was 194.0MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 103.1MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 431.6MB. 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] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L719] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L720] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L721] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L722] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L723] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L724] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L725] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L726] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L727] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L728] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L729] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L730] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L731] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L732] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L733] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L734] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L735] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 pthread_t t1489; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] FCALL, FORK 0 pthread_create(&t1489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1489, ((void *)0), P0, ((void *)0))=-2, t1489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 1 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] 0 pthread_t t1490; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1489={5:0}, t1490={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t1490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1490, ((void *)0), P1, ((void *)0))=-1, t1489={5:0}, t1490={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L835] 0 pthread_t t1491; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1489={5:0}, t1490={6:0}, t1491={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L836] FCALL, FORK 0 pthread_create(&t1491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1491, ((void *)0), P2, ((void *)0))=0, t1489={5:0}, t1490={6:0}, t1491={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z [L797] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L798] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L799] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L800] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L801] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L803] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EAX = z [L805] 3 z = z$flush_delayed ? z$mem_tmp : z [L806] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1489={5:0}, t1490={6:0}, t1491={3:0}, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L846] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1489={5:0}, t1490={6:0}, t1491={3:0}, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1489={5:0}, t1490={6:0}, t1491={3:0}, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 836]: 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: 832]: 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, 134 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: 13.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 657 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 657 mSDsluCounter, 426 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 339 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1146 IncrementalHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 87 mSDtfsCounter, 1146 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15993occurred in iteration=8, InterpolantAutomatonStates: 89, 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, 2.1s InterpolantComputationTime, 645 NumberOfCodeBlocks, 645 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 554 ConstructedInterpolants, 0 QuantifiedInterpolants, 2577 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:32:57,379 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...