/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 --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 23:37:37,500 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 23:37:37,501 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 23:37:37,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 23:37:37,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 23:37:37,533 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 23:37:37,547 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 23:37:37,551 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 23:37:37,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 23:37:37,558 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 23:37:37,559 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 23:37:37,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 23:37:37,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 23:37:37,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 23:37:37,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 23:37:37,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 23:37:37,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 23:37:37,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 23:37:37,568 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 23:37:37,573 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 23:37:37,574 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 23:37:37,574 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 23:37:37,575 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 23:37:37,576 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 23:37:37,581 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 23:37:37,581 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 23:37:37,581 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 23:37:37,582 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 23:37:37,583 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 23:37:37,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 23:37:37,586 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 23:37:37,588 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 23:37:37,589 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 23:37:37,589 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 23:37:37,589 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 23:37:37,590 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 23:37:37,590 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 23:37:37,590 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 23:37:37,590 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 23:37:37,591 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 23:37:37,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 23:37:37,592 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-11 23:37:37,615 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 23:37:37,615 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 23:37:37,616 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 23:37:37,617 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 23:37:37,617 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 23:37:37,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 23:37:37,618 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 23:37:37,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 23:37:37,618 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 23:37:37,618 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 23:37:37,619 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 23:37:37,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 23:37:37,619 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 23:37:37,619 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 23:37:37,619 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 23:37:37,619 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 23:37:37,619 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 23:37:37,619 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 23:37:37,619 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 23:37:37,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 23:37:37,620 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 23:37:37,620 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 23:37:37,620 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 23:37:37,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:37:37,620 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 23:37:37,620 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 23:37:37,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 23:37:37,620 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 23:37:37,620 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 23:37:37,620 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 23:37:37,621 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 23:37:37,621 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-11 23:37:37,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 23:37:37,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 23:37:37,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 23:37:37,887 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 23:37:37,888 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 23:37:37,888 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2022-12-11 23:37:38,826 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 23:37:39,044 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 23:37:39,044 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2022-12-11 23:37:39,055 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1c1b7230/6c8ff49e1cc44df1b8e0de3429cc80b9/FLAGc6367e685 [2022-12-11 23:37:39,066 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1c1b7230/6c8ff49e1cc44df1b8e0de3429cc80b9 [2022-12-11 23:37:39,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 23:37:39,069 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 23:37:39,070 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 23:37:39,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 23:37:39,072 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 23:37:39,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:37:39" (1/1) ... [2022-12-11 23:37:39,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d356237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:39, skipping insertion in model container [2022-12-11 23:37:39,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:37:39" (1/1) ... [2022-12-11 23:37:39,078 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 23:37:39,116 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 23:37:39,263 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/mix038_tso.oepc.i[949,962] [2022-12-11 23:37:39,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:37:39,491 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 23:37:39,503 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/mix038_tso.oepc.i[949,962] [2022-12-11 23:37:39,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:37:39,555 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:37:39,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:37:39,591 INFO L208 MainTranslator]: Completed translation [2022-12-11 23:37:39,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:39 WrapperNode [2022-12-11 23:37:39,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 23:37:39,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 23:37:39,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 23:37:39,594 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 23:37:39,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:39" (1/1) ... [2022-12-11 23:37:39,623 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:39" (1/1) ... [2022-12-11 23:37:39,649 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-11 23:37:39,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 23:37:39,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 23:37:39,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 23:37:39,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 23:37:39,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:39" (1/1) ... [2022-12-11 23:37:39,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:39" (1/1) ... [2022-12-11 23:37:39,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:39" (1/1) ... [2022-12-11 23:37:39,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:39" (1/1) ... [2022-12-11 23:37:39,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:39" (1/1) ... [2022-12-11 23:37:39,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:39" (1/1) ... [2022-12-11 23:37:39,667 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:39" (1/1) ... [2022-12-11 23:37:39,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:39" (1/1) ... [2022-12-11 23:37:39,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 23:37:39,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 23:37:39,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 23:37:39,671 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 23:37:39,672 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:39" (1/1) ... [2022-12-11 23:37:39,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:37:39,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 23:37:39,707 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-11 23:37:39,711 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-11 23:37:39,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 23:37:39,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 23:37:39,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 23:37:39,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 23:37:39,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 23:37:39,739 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 23:37:39,740 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 23:37:39,740 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 23:37:39,740 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 23:37:39,740 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 23:37:39,740 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 23:37:39,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 23:37:39,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 23:37:39,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 23:37:39,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 23:37:39,741 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 23:37:39,857 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 23:37:39,859 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 23:37:40,092 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 23:37:40,189 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 23:37:40,189 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 23:37:40,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:37:40 BoogieIcfgContainer [2022-12-11 23:37:40,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 23:37:40,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 23:37:40,193 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 23:37:40,195 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 23:37:40,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 11:37:39" (1/3) ... [2022-12-11 23:37:40,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53354807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:37:40, skipping insertion in model container [2022-12-11 23:37:40,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:37:39" (2/3) ... [2022-12-11 23:37:40,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53354807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:37:40, skipping insertion in model container [2022-12-11 23:37:40,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:37:40" (3/3) ... [2022-12-11 23:37:40,197 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2022-12-11 23:37:40,210 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 23:37:40,210 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 23:37:40,211 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 23:37:40,255 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 23:37:40,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2022-12-11 23:37:40,342 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-11 23:37:40,342 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 23:37:40,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-11 23:37:40,365 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2022-12-11 23:37:40,368 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2022-12-11 23:37:40,375 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 23:37:40,379 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;@63253988, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 23:37:40,380 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-11 23:37:40,389 INFO L130 PetriNetUnfolder]: 0/58 cut-off events. [2022-12-11 23:37:40,389 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 23:37:40,389 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:37:40,390 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:37:40,390 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:37:40,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:37:40,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1691894183, now seen corresponding path program 1 times [2022-12-11 23:37:40,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:37:40,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267525923] [2022-12-11 23:37:40,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:37:40,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:37:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:37:40,773 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-11 23:37:40,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:37:40,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267525923] [2022-12-11 23:37:40,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267525923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:37:40,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:37:40,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 23:37:40,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055988017] [2022-12-11 23:37:40,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:37:40,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 23:37:40,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:37:40,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 23:37:40,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 23:37:40,801 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 112 [2022-12-11 23:37:40,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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-11 23:37:40,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:37:40,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 112 [2022-12-11 23:37:40,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:37:40,927 INFO L130 PetriNetUnfolder]: 57/448 cut-off events. [2022-12-11 23:37:40,927 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-11 23:37:40,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 448 events. 57/448 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2316 event pairs, 31 based on Foata normal form. 18/436 useless extension candidates. Maximal degree in co-relation 522. Up to 75 conditions per place. [2022-12-11 23:37:40,935 INFO L137 encePairwiseOnDemand]: 107/112 looper letters, 13 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2022-12-11 23:37:40,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 110 transitions, 262 flow [2022-12-11 23:37:40,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 23:37:40,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 23:37:40,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2022-12-11 23:37:40,949 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9345238095238095 [2022-12-11 23:37:40,954 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 0 predicate places. [2022-12-11 23:37:40,954 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 110 transitions, 262 flow [2022-12-11 23:37:40,957 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 110 transitions, 262 flow [2022-12-11 23:37:40,958 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 110 transitions, 262 flow [2022-12-11 23:37:40,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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-11 23:37:40,959 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:37:40,959 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:37:40,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 23:37:40,959 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:37:40,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:37:40,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1022843463, now seen corresponding path program 1 times [2022-12-11 23:37:40,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:37:40,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271579003] [2022-12-11 23:37:40,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:37:40,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:37:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:37:41,622 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-11 23:37:41,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:37:41,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271579003] [2022-12-11 23:37:41,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271579003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:37:41,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:37:41,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:37:41,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845530759] [2022-12-11 23:37:41,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:37:41,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:37:41,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:37:41,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:37:41,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:37:41,627 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 112 [2022-12-11 23:37:41,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 110 transitions, 262 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-11 23:37:41,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:37:41,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 112 [2022-12-11 23:37:41,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:37:42,156 INFO L130 PetriNetUnfolder]: 1114/2688 cut-off events. [2022-12-11 23:37:42,156 INFO L131 PetriNetUnfolder]: For 595/850 co-relation queries the response was YES. [2022-12-11 23:37:42,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5158 conditions, 2688 events. 1114/2688 cut-off events. For 595/850 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 20279 event pairs, 159 based on Foata normal form. 0/2619 useless extension candidates. Maximal degree in co-relation 5094. Up to 878 conditions per place. [2022-12-11 23:37:42,173 INFO L137 encePairwiseOnDemand]: 106/112 looper letters, 39 selfloop transitions, 2 changer transitions 68/176 dead transitions. [2022-12-11 23:37:42,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 176 transitions, 670 flow [2022-12-11 23:37:42,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 23:37:42,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 23:37:42,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 796 transitions. [2022-12-11 23:37:42,220 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7896825396825397 [2022-12-11 23:37:42,221 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 8 predicate places. [2022-12-11 23:37:42,221 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 176 transitions, 670 flow [2022-12-11 23:37:42,227 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 108 transitions, 352 flow [2022-12-11 23:37:42,227 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 108 transitions, 352 flow [2022-12-11 23:37:42,228 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-11 23:37:42,228 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:37:42,228 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:37:42,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 23:37:42,228 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:37:42,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:37:42,228 INFO L85 PathProgramCache]: Analyzing trace with hash -842202693, now seen corresponding path program 1 times [2022-12-11 23:37:42,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:37:42,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931248763] [2022-12-11 23:37:42,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:37:42,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:37:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:37:42,892 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-11 23:37:42,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:37:42,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931248763] [2022-12-11 23:37:42,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931248763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:37:42,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:37:42,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 23:37:42,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673988900] [2022-12-11 23:37:42,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:37:42,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 23:37:42,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:37:42,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 23:37:42,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-11 23:37:42,896 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 112 [2022-12-11 23:37:42,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 108 transitions, 352 flow. Second operand has 10 states, 10 states have (on average 81.1) internal successors, (811), 10 states have internal predecessors, (811), 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-11 23:37:42,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:37:42,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 112 [2022-12-11 23:37:42,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:37:43,614 INFO L130 PetriNetUnfolder]: 856/1684 cut-off events. [2022-12-11 23:37:43,615 INFO L131 PetriNetUnfolder]: For 587/2025 co-relation queries the response was YES. [2022-12-11 23:37:43,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4998 conditions, 1684 events. 856/1684 cut-off events. For 587/2025 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9666 event pairs, 102 based on Foata normal form. 51/1699 useless extension candidates. Maximal degree in co-relation 4921. Up to 1224 conditions per place. [2022-12-11 23:37:43,622 INFO L137 encePairwiseOnDemand]: 93/112 looper letters, 48 selfloop transitions, 28 changer transitions 80/223 dead transitions. [2022-12-11 23:37:43,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 223 transitions, 1267 flow [2022-12-11 23:37:43,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-11 23:37:43,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-11 23:37:43,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1711 transitions. [2022-12-11 23:37:43,626 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7638392857142857 [2022-12-11 23:37:43,626 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 11 predicate places. [2022-12-11 23:37:43,626 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 223 transitions, 1267 flow [2022-12-11 23:37:43,632 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 143 transitions, 705 flow [2022-12-11 23:37:43,632 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 143 transitions, 705 flow [2022-12-11 23:37:43,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 81.1) internal successors, (811), 10 states have internal predecessors, (811), 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-11 23:37:43,633 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:37:43,633 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:37:43,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 23:37:43,633 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:37:43,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:37:43,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1000411417, now seen corresponding path program 1 times [2022-12-11 23:37:43,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:37:43,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654064387] [2022-12-11 23:37:43,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:37:43,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:37:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:37:44,502 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-11 23:37:44,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:37:44,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654064387] [2022-12-11 23:37:44,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654064387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:37:44,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:37:44,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-11 23:37:44,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629934603] [2022-12-11 23:37:44,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:37:44,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-11 23:37:44,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:37:44,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-11 23:37:44,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-12-11 23:37:44,509 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 112 [2022-12-11 23:37:44,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 143 transitions, 705 flow. Second operand has 13 states, 13 states have (on average 80.6923076923077) internal successors, (1049), 13 states have internal predecessors, (1049), 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-11 23:37:44,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:37:44,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 112 [2022-12-11 23:37:44,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:37:45,200 INFO L130 PetriNetUnfolder]: 798/1574 cut-off events. [2022-12-11 23:37:45,200 INFO L131 PetriNetUnfolder]: For 1023/3420 co-relation queries the response was YES. [2022-12-11 23:37:45,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5951 conditions, 1574 events. 798/1574 cut-off events. For 1023/3420 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8766 event pairs, 104 based on Foata normal form. 86/1604 useless extension candidates. Maximal degree in co-relation 5861. Up to 1178 conditions per place. [2022-12-11 23:37:45,208 INFO L137 encePairwiseOnDemand]: 91/112 looper letters, 54 selfloop transitions, 42 changer transitions 60/223 dead transitions. [2022-12-11 23:37:45,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 223 transitions, 1574 flow [2022-12-11 23:37:45,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-11 23:37:45,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-11 23:37:45,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1617 transitions. [2022-12-11 23:37:45,212 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7598684210526315 [2022-12-11 23:37:45,213 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 17 predicate places. [2022-12-11 23:37:45,213 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 223 transitions, 1574 flow [2022-12-11 23:37:45,220 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 163 transitions, 1040 flow [2022-12-11 23:37:45,220 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 163 transitions, 1040 flow [2022-12-11 23:37:45,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 80.6923076923077) internal successors, (1049), 13 states have internal predecessors, (1049), 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-11 23:37:45,221 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:37:45,221 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:37:45,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 23:37:45,221 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:37:45,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:37:45,221 INFO L85 PathProgramCache]: Analyzing trace with hash -348765369, now seen corresponding path program 1 times [2022-12-11 23:37:45,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:37:45,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471792350] [2022-12-11 23:37:45,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:37:45,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:37:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:37:45,584 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-11 23:37:45,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:37:45,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471792350] [2022-12-11 23:37:45,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471792350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:37:45,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:37:45,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 23:37:45,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834219029] [2022-12-11 23:37:45,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:37:45,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 23:37:45,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:37:45,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 23:37:45,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-11 23:37:45,586 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-12-11 23:37:45,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 163 transitions, 1040 flow. Second operand has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 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-11 23:37:45,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:37:45,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-12-11 23:37:45,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:37:45,913 INFO L130 PetriNetUnfolder]: 631/1290 cut-off events. [2022-12-11 23:37:45,913 INFO L131 PetriNetUnfolder]: For 2003/4241 co-relation queries the response was YES. [2022-12-11 23:37:45,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5624 conditions, 1290 events. 631/1290 cut-off events. For 2003/4241 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6615 event pairs, 133 based on Foata normal form. 59/1293 useless extension candidates. Maximal degree in co-relation 5527. Up to 941 conditions per place. [2022-12-11 23:37:45,921 INFO L137 encePairwiseOnDemand]: 103/112 looper letters, 58 selfloop transitions, 11 changer transitions 25/187 dead transitions. [2022-12-11 23:37:45,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 187 transitions, 1456 flow [2022-12-11 23:37:45,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-11 23:37:45,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-11 23:37:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1112 transitions. [2022-12-11 23:37:45,924 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8273809523809523 [2022-12-11 23:37:45,924 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 19 predicate places. [2022-12-11 23:37:45,924 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 187 transitions, 1456 flow [2022-12-11 23:37:45,931 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 162 transitions, 1168 flow [2022-12-11 23:37:45,931 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 162 transitions, 1168 flow [2022-12-11 23:37:45,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 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-11 23:37:45,932 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:37:45,932 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:37:45,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 23:37:45,932 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:37:45,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:37:45,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1299978052, now seen corresponding path program 1 times [2022-12-11 23:37:45,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:37:45,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596957184] [2022-12-11 23:37:45,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:37:45,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:37:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:37:46,096 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-11 23:37:46,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:37:46,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596957184] [2022-12-11 23:37:46,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596957184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:37:46,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:37:46,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 23:37:46,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926837478] [2022-12-11 23:37:46,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:37:46,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 23:37:46,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:37:46,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 23:37:46,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 23:37:46,099 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-12-11 23:37:46,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 162 transitions, 1168 flow. Second operand has 6 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 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-11 23:37:46,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:37:46,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-12-11 23:37:46,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:37:46,573 INFO L130 PetriNetUnfolder]: 2082/3719 cut-off events. [2022-12-11 23:37:46,573 INFO L131 PetriNetUnfolder]: For 20763/25725 co-relation queries the response was YES. [2022-12-11 23:37:46,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16030 conditions, 3719 events. 2082/3719 cut-off events. For 20763/25725 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 24769 event pairs, 145 based on Foata normal form. 59/3439 useless extension candidates. Maximal degree in co-relation 15929. Up to 1966 conditions per place. [2022-12-11 23:37:46,593 INFO L137 encePairwiseOnDemand]: 102/112 looper letters, 164 selfloop transitions, 15 changer transitions 35/309 dead transitions. [2022-12-11 23:37:46,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 309 transitions, 3083 flow [2022-12-11 23:37:46,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 23:37:46,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 23:37:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 962 transitions. [2022-12-11 23:37:46,596 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8589285714285714 [2022-12-11 23:37:46,596 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 22 predicate places. [2022-12-11 23:37:46,596 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 309 transitions, 3083 flow [2022-12-11 23:37:46,611 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 274 transitions, 2653 flow [2022-12-11 23:37:46,612 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 274 transitions, 2653 flow [2022-12-11 23:37:46,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 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-11 23:37:46,612 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:37:46,612 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:37:46,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 23:37:46,612 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:37:46,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:37:46,613 INFO L85 PathProgramCache]: Analyzing trace with hash -577302477, now seen corresponding path program 1 times [2022-12-11 23:37:46,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:37:46,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131114632] [2022-12-11 23:37:46,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:37:46,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:37:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:37:46,762 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-11 23:37:46,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:37:46,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131114632] [2022-12-11 23:37:46,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131114632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:37:46,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:37:46,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:37:46,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984732040] [2022-12-11 23:37:46,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:37:46,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:37:46,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:37:46,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:37:46,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:37:46,764 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-12-11 23:37:46,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 274 transitions, 2653 flow. Second operand has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 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-11 23:37:46,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:37:46,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-12-11 23:37:46,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:37:47,087 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L806-->L813: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd3~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_118 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_118) v_~x$w_buff0_used~0_117) (= v_~x$r_buff1_thd3~0_23 (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse2 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0)))) 0 v_~x$r_buff1_thd3~0_24)) (= v_~x$r_buff0_thd3~0_25 (ite .cse3 0 v_~x$r_buff0_thd3~0_26)) (= v_~x$w_buff1_used~0_98 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_99)) (= v_~x~0_71 (ite .cse0 v_~x$w_buff0~0_45 (ite .cse4 v_~x$w_buff1~0_40 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][199], [18#L780true, 260#(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)), 177#true, P0Thread1of1ForFork1InUse, 61#L2true, 143#true, 241#(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)), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 123#true, 58#L751true, 93#L813true, 126#true, 212#(= 0 ~x$r_buff0_thd0~0)]) [2022-12-11 23:37:47,087 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-11 23:37:47,087 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-11 23:37:47,087 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-11 23:37:47,088 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-11 23:37:47,088 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([334] L751-->L758: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_105 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_106 256) 0)) .cse5)) (.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_89 256) 0))))) (and (= v_~x$w_buff0_used~0_105 (ite .cse0 0 v_~x$w_buff0_used~0_106)) (= v_~x$w_buff1_used~0_88 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_89)) (= v_~x$r_buff0_thd1~0_21 (ite .cse1 0 v_~x$r_buff0_thd1~0_22)) (= v_~x~0_59 (ite .cse0 v_~x$w_buff0~0_37 (ite .cse2 v_~x$w_buff1~0_32 v_~x~0_60))) (= v_~x$r_buff1_thd1~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_88 256) 0)))) 0 v_~x$r_buff1_thd1~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_37, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_60, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_37, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][172], [18#L780true, 83#L806true, 260#(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)), 51#L758true, 177#true, P0Thread1of1ForFork1InUse, 143#true, 61#L2true, 241#(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)), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 123#true, 126#true, 212#(= 0 ~x$r_buff0_thd0~0)]) [2022-12-11 23:37:47,088 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-11 23:37:47,088 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-11 23:37:47,088 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-11 23:37:47,088 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-11 23:37:47,111 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L806-->L813: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd3~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_118 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_118) v_~x$w_buff0_used~0_117) (= v_~x$r_buff1_thd3~0_23 (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse2 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0)))) 0 v_~x$r_buff1_thd3~0_24)) (= v_~x$r_buff0_thd3~0_25 (ite .cse3 0 v_~x$r_buff0_thd3~0_26)) (= v_~x$w_buff1_used~0_98 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_99)) (= v_~x~0_71 (ite .cse0 v_~x$w_buff0~0_45 (ite .cse4 v_~x$w_buff1~0_40 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][199], [18#L780true, 260#(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)), 51#L758true, 177#true, P0Thread1of1ForFork1InUse, 61#L2true, 143#true, 241#(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)), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 123#true, 93#L813true, 126#true, 212#(= 0 ~x$r_buff0_thd0~0)]) [2022-12-11 23:37:47,111 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-11 23:37:47,111 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-11 23:37:47,111 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-11 23:37:47,111 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-11 23:37:47,112 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L806-->L813: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd3~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_118 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_118) v_~x$w_buff0_used~0_117) (= v_~x$r_buff1_thd3~0_23 (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse2 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0)))) 0 v_~x$r_buff1_thd3~0_24)) (= v_~x$r_buff0_thd3~0_25 (ite .cse3 0 v_~x$r_buff0_thd3~0_26)) (= v_~x$w_buff1_used~0_98 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_99)) (= v_~x~0_71 (ite .cse0 v_~x$w_buff0~0_45 (ite .cse4 v_~x$w_buff1~0_40 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][225], [18#L780true, 262#(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)), 243#(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)), 47#L3true, 177#true, P0Thread1of1ForFork1InUse, 143#true, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 123#true, 58#L751true, 93#L813true, 126#true, 212#(= 0 ~x$r_buff0_thd0~0)]) [2022-12-11 23:37:47,112 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-12-11 23:37:47,112 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-11 23:37:47,112 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-11 23:37:47,112 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-11 23:37:47,134 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L806-->L813: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd3~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_118 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_118) v_~x$w_buff0_used~0_117) (= v_~x$r_buff1_thd3~0_23 (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse2 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0)))) 0 v_~x$r_buff1_thd3~0_24)) (= v_~x$r_buff0_thd3~0_25 (ite .cse3 0 v_~x$r_buff0_thd3~0_26)) (= v_~x$w_buff1_used~0_98 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_99)) (= v_~x~0_71 (ite .cse0 v_~x$w_buff0~0_45 (ite .cse4 v_~x$w_buff1~0_40 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][225], [18#L780true, 262#(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)), 243#(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)), 47#L3true, 51#L758true, 177#true, P0Thread1of1ForFork1InUse, 143#true, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 123#true, 93#L813true, 126#true, 212#(= 0 ~x$r_buff0_thd0~0)]) [2022-12-11 23:37:47,134 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-11 23:37:47,135 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-11 23:37:47,135 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-11 23:37:47,135 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-11 23:37:47,144 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L806-->L813: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd3~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_118 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_118) v_~x$w_buff0_used~0_117) (= v_~x$r_buff1_thd3~0_23 (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse2 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0)))) 0 v_~x$r_buff1_thd3~0_24)) (= v_~x$r_buff0_thd3~0_25 (ite .cse3 0 v_~x$r_buff0_thd3~0_26)) (= v_~x$w_buff1_used~0_98 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_99)) (= v_~x~0_71 (ite .cse0 v_~x$w_buff0~0_45 (ite .cse4 v_~x$w_buff1~0_40 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][225], [111#L3-1true, 18#L780true, 262#(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)), 243#(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)), 177#true, P0Thread1of1ForFork1InUse, 143#true, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 123#true, 58#L751true, 93#L813true, 126#true, 212#(= 0 ~x$r_buff0_thd0~0)]) [2022-12-11 23:37:47,145 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-11 23:37:47,145 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-11 23:37:47,145 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-11 23:37:47,145 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-11 23:37:47,145 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([334] L751-->L758: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_105 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_106 256) 0)) .cse5)) (.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_89 256) 0))))) (and (= v_~x$w_buff0_used~0_105 (ite .cse0 0 v_~x$w_buff0_used~0_106)) (= v_~x$w_buff1_used~0_88 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_89)) (= v_~x$r_buff0_thd1~0_21 (ite .cse1 0 v_~x$r_buff0_thd1~0_22)) (= v_~x~0_59 (ite .cse0 v_~x$w_buff0~0_37 (ite .cse2 v_~x$w_buff1~0_32 v_~x~0_60))) (= v_~x$r_buff1_thd1~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_88 256) 0)))) 0 v_~x$r_buff1_thd1~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_37, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_60, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_37, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][224], [18#L780true, 83#L806true, 262#(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)), 243#(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)), 47#L3true, 51#L758true, 177#true, P0Thread1of1ForFork1InUse, 143#true, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 123#true, 126#true, 212#(= 0 ~x$r_buff0_thd0~0)]) [2022-12-11 23:37:47,145 INFO L382 tUnfolder$Statistics]: this new event has 74 ancestors and is not cut-off event [2022-12-11 23:37:47,145 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is not cut-off event [2022-12-11 23:37:47,145 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is not cut-off event [2022-12-11 23:37:47,145 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is not cut-off event [2022-12-11 23:37:47,146 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([351] L806-->L813: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd3~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_118 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_118) v_~x$w_buff0_used~0_117) (= v_~x$r_buff1_thd3~0_23 (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse2 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0)))) 0 v_~x$r_buff1_thd3~0_24)) (= v_~x$r_buff0_thd3~0_25 (ite .cse3 0 v_~x$r_buff0_thd3~0_26)) (= v_~x$w_buff1_used~0_98 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_99)) (= v_~x~0_71 (ite .cse0 v_~x$w_buff0~0_45 (ite .cse4 v_~x$w_buff1~0_40 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][225], [18#L780true, 262#(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)), 243#(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)), 47#L3true, 51#L758true, 177#true, P0Thread1of1ForFork1InUse, 143#true, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 123#true, 93#L813true, 126#true, 212#(= 0 ~x$r_buff0_thd0~0)]) [2022-12-11 23:37:47,146 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-11 23:37:47,146 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-11 23:37:47,146 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-11 23:37:47,146 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-11 23:37:47,146 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-11 23:37:47,162 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L806-->L813: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd3~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_118 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_118) v_~x$w_buff0_used~0_117) (= v_~x$r_buff1_thd3~0_23 (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse2 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0)))) 0 v_~x$r_buff1_thd3~0_24)) (= v_~x$r_buff0_thd3~0_25 (ite .cse3 0 v_~x$r_buff0_thd3~0_26)) (= v_~x$w_buff1_used~0_98 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_99)) (= v_~x~0_71 (ite .cse0 v_~x$w_buff0~0_45 (ite .cse4 v_~x$w_buff1~0_40 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][225], [111#L3-1true, 18#L780true, 262#(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)), 243#(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)), 177#true, 51#L758true, P0Thread1of1ForFork1InUse, 143#true, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 123#true, 93#L813true, 126#true, 212#(= 0 ~x$r_buff0_thd0~0)]) [2022-12-11 23:37:47,162 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-11 23:37:47,163 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-11 23:37:47,163 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-11 23:37:47,163 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-11 23:37:47,203 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([334] L751-->L758: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_105 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_106 256) 0)) .cse5)) (.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_89 256) 0))))) (and (= v_~x$w_buff0_used~0_105 (ite .cse0 0 v_~x$w_buff0_used~0_106)) (= v_~x$w_buff1_used~0_88 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_89)) (= v_~x$r_buff0_thd1~0_21 (ite .cse1 0 v_~x$r_buff0_thd1~0_22)) (= v_~x~0_59 (ite .cse0 v_~x$w_buff0~0_37 (ite .cse2 v_~x$w_buff1~0_32 v_~x~0_60))) (= v_~x$r_buff1_thd1~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_88 256) 0)))) 0 v_~x$r_buff1_thd1~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_37, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_60, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_37, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][224], [111#L3-1true, 18#L780true, 83#L806true, 262#(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)), 243#(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)), 51#L758true, 177#true, 143#true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 123#true, P2Thread1of1ForFork0InUse, 126#true, 212#(= 0 ~x$r_buff0_thd0~0)]) [2022-12-11 23:37:47,204 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is not cut-off event [2022-12-11 23:37:47,204 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is not cut-off event [2022-12-11 23:37:47,204 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is not cut-off event [2022-12-11 23:37:47,204 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is not cut-off event [2022-12-11 23:37:47,204 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([351] L806-->L813: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd3~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_118 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_118) v_~x$w_buff0_used~0_117) (= v_~x$r_buff1_thd3~0_23 (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse2 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0)))) 0 v_~x$r_buff1_thd3~0_24)) (= v_~x$r_buff0_thd3~0_25 (ite .cse3 0 v_~x$r_buff0_thd3~0_26)) (= v_~x$w_buff1_used~0_98 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_99)) (= v_~x~0_71 (ite .cse0 v_~x$w_buff0~0_45 (ite .cse4 v_~x$w_buff1~0_40 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][225], [111#L3-1true, 18#L780true, 262#(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)), 243#(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)), 177#true, 51#L758true, P0Thread1of1ForFork1InUse, 143#true, P1Thread1of1ForFork2InUse, 123#true, P2Thread1of1ForFork0InUse, 93#L813true, 126#true, 212#(= 0 ~x$r_buff0_thd0~0)]) [2022-12-11 23:37:47,204 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-11 23:37:47,204 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-11 23:37:47,204 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-11 23:37:47,204 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-11 23:37:47,204 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-11 23:37:47,268 INFO L130 PetriNetUnfolder]: 1393/2848 cut-off events. [2022-12-11 23:37:47,268 INFO L131 PetriNetUnfolder]: For 15598/20296 co-relation queries the response was YES. [2022-12-11 23:37:47,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13331 conditions, 2848 events. 1393/2848 cut-off events. For 15598/20296 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 20489 event pairs, 56 based on Foata normal form. 506/3124 useless extension candidates. Maximal degree in co-relation 13226. Up to 1227 conditions per place. [2022-12-11 23:37:47,282 INFO L137 encePairwiseOnDemand]: 102/112 looper letters, 193 selfloop transitions, 36 changer transitions 49/371 dead transitions. [2022-12-11 23:37:47,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 371 transitions, 4160 flow [2022-12-11 23:37:47,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:37:47,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:37:47,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1249 transitions. [2022-12-11 23:37:47,285 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8578296703296703 [2022-12-11 23:37:47,286 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 34 predicate places. [2022-12-11 23:37:47,286 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 371 transitions, 4160 flow [2022-12-11 23:37:47,296 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 322 transitions, 3586 flow [2022-12-11 23:37:47,296 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 322 transitions, 3586 flow [2022-12-11 23:37:47,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 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-11 23:37:47,298 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:37:47,298 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:37:47,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 23:37:47,298 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:37:47,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:37:47,299 INFO L85 PathProgramCache]: Analyzing trace with hash 175049908, now seen corresponding path program 1 times [2022-12-11 23:37:47,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:37:47,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606847401] [2022-12-11 23:37:47,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:37:47,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:37:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:37:47,475 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-11 23:37:47,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:37:47,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606847401] [2022-12-11 23:37:47,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606847401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:37:47,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:37:47,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 23:37:47,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770388138] [2022-12-11 23:37:47,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:37:47,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 23:37:47,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:37:47,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 23:37:47,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 23:37:47,477 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-12-11 23:37:47,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 322 transitions, 3586 flow. Second operand has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 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-11 23:37:47,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:37:47,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-12-11 23:37:47,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:37:47,984 INFO L130 PetriNetUnfolder]: 1227/2663 cut-off events. [2022-12-11 23:37:47,984 INFO L131 PetriNetUnfolder]: For 15259/19975 co-relation queries the response was YES. [2022-12-11 23:37:47,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13964 conditions, 2663 events. 1227/2663 cut-off events. For 15259/19975 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 20179 event pairs, 66 based on Foata normal form. 560/3037 useless extension candidates. Maximal degree in co-relation 13855. Up to 1081 conditions per place. [2022-12-11 23:37:47,997 INFO L137 encePairwiseOnDemand]: 102/112 looper letters, 139 selfloop transitions, 34 changer transitions 77/343 dead transitions. [2022-12-11 23:37:47,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 343 transitions, 4272 flow [2022-12-11 23:37:47,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 23:37:47,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 23:37:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1504 transitions. [2022-12-11 23:37:48,001 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8392857142857143 [2022-12-11 23:37:48,003 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 49 predicate places. [2022-12-11 23:37:48,003 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 343 transitions, 4272 flow [2022-12-11 23:37:48,012 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 266 transitions, 3086 flow [2022-12-11 23:37:48,012 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 266 transitions, 3086 flow [2022-12-11 23:37:48,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 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-11 23:37:48,013 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:37:48,013 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:37:48,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 23:37:48,014 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:37:48,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:37:48,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1853937183, now seen corresponding path program 1 times [2022-12-11 23:37:48,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:37:48,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650349184] [2022-12-11 23:37:48,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:37:48,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:37:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:37:48,195 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-11 23:37:48,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:37:48,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650349184] [2022-12-11 23:37:48,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650349184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:37:48,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:37:48,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:37:48,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320564568] [2022-12-11 23:37:48,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:37:48,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:37:48,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:37:48,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:37:48,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:37:48,197 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-12-11 23:37:48,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 266 transitions, 3086 flow. Second operand has 7 states, 7 states have (on average 91.57142857142857) internal successors, (641), 7 states have internal predecessors, (641), 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-11 23:37:48,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:37:48,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-12-11 23:37:48,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:37:48,619 INFO L130 PetriNetUnfolder]: 1309/3517 cut-off events. [2022-12-11 23:37:48,619 INFO L131 PetriNetUnfolder]: For 23625/28781 co-relation queries the response was YES. [2022-12-11 23:37:48,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17698 conditions, 3517 events. 1309/3517 cut-off events. For 23625/28781 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 32205 event pairs, 56 based on Foata normal form. 79/3449 useless extension candidates. Maximal degree in co-relation 17584. Up to 1083 conditions per place. [2022-12-11 23:37:48,631 INFO L137 encePairwiseOnDemand]: 106/112 looper letters, 110 selfloop transitions, 1 changer transitions 150/385 dead transitions. [2022-12-11 23:37:48,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 385 transitions, 5697 flow [2022-12-11 23:37:48,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 23:37:48,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 23:37:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 657 transitions. [2022-12-11 23:37:48,633 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8380102040816326 [2022-12-11 23:37:48,634 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 52 predicate places. [2022-12-11 23:37:48,634 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 385 transitions, 5697 flow [2022-12-11 23:37:48,641 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 235 transitions, 2810 flow [2022-12-11 23:37:48,641 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 235 transitions, 2810 flow [2022-12-11 23:37:48,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.57142857142857) internal successors, (641), 7 states have internal predecessors, (641), 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-11 23:37:48,641 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:37:48,642 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:37:48,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 23:37:48,642 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:37:48,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:37:48,642 INFO L85 PathProgramCache]: Analyzing trace with hash -281861051, now seen corresponding path program 2 times [2022-12-11 23:37:48,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:37:48,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237993766] [2022-12-11 23:37:48,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:37:48,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:37:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:37:49,377 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-11 23:37:49,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:37:49,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237993766] [2022-12-11 23:37:49,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237993766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:37:49,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:37:49,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-11 23:37:49,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385691394] [2022-12-11 23:37:49,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:37:49,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 23:37:49,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:37:49,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 23:37:49,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-12-11 23:37:49,383 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 112 [2022-12-11 23:37:49,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 235 transitions, 2810 flow. Second operand has 12 states, 12 states have (on average 85.0) internal successors, (1020), 12 states have internal predecessors, (1020), 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-11 23:37:49,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:37:49,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 112 [2022-12-11 23:37:49,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:37:49,825 INFO L130 PetriNetUnfolder]: 814/2832 cut-off events. [2022-12-11 23:37:49,825 INFO L131 PetriNetUnfolder]: For 15034/16366 co-relation queries the response was YES. [2022-12-11 23:37:49,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12751 conditions, 2832 events. 814/2832 cut-off events. For 15034/16366 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 28301 event pairs, 45 based on Foata normal form. 63/2848 useless extension candidates. Maximal degree in co-relation 12625. Up to 633 conditions per place. [2022-12-11 23:37:49,836 INFO L137 encePairwiseOnDemand]: 101/112 looper letters, 67 selfloop transitions, 44 changer transitions 39/257 dead transitions. [2022-12-11 23:37:49,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 257 transitions, 3504 flow [2022-12-11 23:37:49,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 23:37:49,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 23:37:49,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 867 transitions. [2022-12-11 23:37:49,838 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7741071428571429 [2022-12-11 23:37:49,839 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 57 predicate places. [2022-12-11 23:37:49,839 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 257 transitions, 3504 flow [2022-12-11 23:37:49,846 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 218 transitions, 2824 flow [2022-12-11 23:37:49,847 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 218 transitions, 2824 flow [2022-12-11 23:37:49,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 85.0) internal successors, (1020), 12 states have internal predecessors, (1020), 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-11 23:37:49,847 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:37:49,847 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:37:49,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 23:37:49,848 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:37:49,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:37:49,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1636756877, now seen corresponding path program 3 times [2022-12-11 23:37:49,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:37:49,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569325371] [2022-12-11 23:37:49,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:37:49,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:37:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:37:50,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:37:50,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:37:50,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569325371] [2022-12-11 23:37:50,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569325371] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:37:50,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:37:50,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-12-11 23:37:50,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218575361] [2022-12-11 23:37:50,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:37:50,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-11 23:37:50,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:37:50,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-11 23:37:50,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-12-11 23:37:50,698 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 112 [2022-12-11 23:37:50,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 218 transitions, 2824 flow. Second operand has 15 states, 15 states have (on average 83.66666666666667) internal successors, (1255), 15 states have internal predecessors, (1255), 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-11 23:37:50,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:37:50,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 112 [2022-12-11 23:37:50,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:37:51,111 INFO L130 PetriNetUnfolder]: 542/2140 cut-off events. [2022-12-11 23:37:51,111 INFO L131 PetriNetUnfolder]: For 14839/15857 co-relation queries the response was YES. [2022-12-11 23:37:51,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10770 conditions, 2140 events. 542/2140 cut-off events. For 14839/15857 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 21059 event pairs, 43 based on Foata normal form. 69/2173 useless extension candidates. Maximal degree in co-relation 10631. Up to 541 conditions per place. [2022-12-11 23:37:51,143 INFO L137 encePairwiseOnDemand]: 101/112 looper letters, 68 selfloop transitions, 42 changer transitions 33/247 dead transitions. [2022-12-11 23:37:51,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 247 transitions, 3710 flow [2022-12-11 23:37:51,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-11 23:37:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-11 23:37:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1025 transitions. [2022-12-11 23:37:51,145 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7626488095238095 [2022-12-11 23:37:51,145 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 62 predicate places. [2022-12-11 23:37:51,145 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 247 transitions, 3710 flow [2022-12-11 23:37:51,151 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 214 transitions, 2976 flow [2022-12-11 23:37:51,151 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 214 transitions, 2976 flow [2022-12-11 23:37:51,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 83.66666666666667) internal successors, (1255), 15 states have internal predecessors, (1255), 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-11 23:37:51,153 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:37:51,153 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:37:51,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 23:37:51,153 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:37:51,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:37:51,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1478704489, now seen corresponding path program 4 times [2022-12-11 23:37:51,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:37:51,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340842279] [2022-12-11 23:37:51,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:37:51,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:37:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:37:51,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:37:51,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:37:51,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340842279] [2022-12-11 23:37:51,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340842279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:37:51,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:37:51,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 23:37:51,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891721720] [2022-12-11 23:37:51,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:37:51,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 23:37:51,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:37:51,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 23:37:51,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-11 23:37:51,449 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 112 [2022-12-11 23:37:51,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 214 transitions, 2976 flow. Second operand has 8 states, 8 states have (on average 80.75) internal successors, (646), 8 states have internal predecessors, (646), 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-11 23:37:51,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:37:51,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 112 [2022-12-11 23:37:51,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:37:51,815 INFO L130 PetriNetUnfolder]: 541/2224 cut-off events. [2022-12-11 23:37:51,815 INFO L131 PetriNetUnfolder]: For 16770/17908 co-relation queries the response was YES. [2022-12-11 23:37:51,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11721 conditions, 2224 events. 541/2224 cut-off events. For 16770/17908 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 22537 event pairs, 44 based on Foata normal form. 33/2244 useless extension candidates. Maximal degree in co-relation 11568. Up to 546 conditions per place. [2022-12-11 23:37:51,823 INFO L137 encePairwiseOnDemand]: 104/112 looper letters, 49 selfloop transitions, 3 changer transitions 141/263 dead transitions. [2022-12-11 23:37:51,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 263 transitions, 4400 flow [2022-12-11 23:37:51,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-11 23:37:51,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-11 23:37:51,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 660 transitions. [2022-12-11 23:37:51,825 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7366071428571429 [2022-12-11 23:37:51,826 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 65 predicate places. [2022-12-11 23:37:51,826 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 263 transitions, 4400 flow [2022-12-11 23:37:51,830 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 122 transitions, 1344 flow [2022-12-11 23:37:51,830 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 122 transitions, 1344 flow [2022-12-11 23:37:51,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 80.75) internal successors, (646), 8 states have internal predecessors, (646), 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-11 23:37:51,831 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:37:51,831 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:37:51,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-11 23:37:51,831 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 23:37:51,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:37:51,832 INFO L85 PathProgramCache]: Analyzing trace with hash -550411243, now seen corresponding path program 5 times [2022-12-11 23:37:51,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:37:51,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424894873] [2022-12-11 23:37:51,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:37:51,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:37:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 23:37:51,883 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 23:37:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 23:37:51,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 23:37:51,956 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 23:37:51,957 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-11 23:37:51,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-11 23:37:51,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-11 23:37:51,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-11 23:37:51,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-11 23:37:51,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-11 23:37:51,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-11 23:37:51,962 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:37:51,967 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 23:37:51,967 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 23:37:52,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 11:37:52 BasicIcfg [2022-12-11 23:37:52,050 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 23:37:52,050 INFO L158 Benchmark]: Toolchain (without parser) took 12980.68ms. Allocated memory was 190.8MB in the beginning and 490.7MB in the end (delta: 299.9MB). Free memory was 165.7MB in the beginning and 367.2MB in the end (delta: -201.5MB). Peak memory consumption was 98.4MB. Max. memory is 8.0GB. [2022-12-11 23:37:52,050 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 190.8MB. Free memory was 167.7MB in the beginning and 167.6MB in the end (delta: 63.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 23:37:52,052 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.03ms. Allocated memory is still 190.8MB. Free memory was 165.2MB in the beginning and 138.4MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-11 23:37:52,052 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.41ms. Allocated memory is still 190.8MB. Free memory was 138.4MB in the beginning and 135.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-11 23:37:52,052 INFO L158 Benchmark]: Boogie Preprocessor took 21.11ms. Allocated memory is still 190.8MB. Free memory was 135.8MB in the beginning and 134.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-11 23:37:52,052 INFO L158 Benchmark]: RCFGBuilder took 519.93ms. Allocated memory is still 190.8MB. Free memory was 134.2MB in the beginning and 98.6MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-11 23:37:52,052 INFO L158 Benchmark]: TraceAbstraction took 11856.64ms. Allocated memory was 190.8MB in the beginning and 490.7MB in the end (delta: 299.9MB). Free memory was 97.5MB in the beginning and 367.2MB in the end (delta: -269.7MB). Peak memory consumption was 31.3MB. Max. memory is 8.0GB. [2022-12-11 23:37:52,053 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.11ms. Allocated memory is still 190.8MB. Free memory was 167.7MB in the beginning and 167.6MB in the end (delta: 63.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 522.03ms. Allocated memory is still 190.8MB. Free memory was 165.2MB in the beginning and 138.4MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.41ms. Allocated memory is still 190.8MB. Free memory was 138.4MB in the beginning and 135.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.11ms. Allocated memory is still 190.8MB. Free memory was 135.8MB in the beginning and 134.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 519.93ms. Allocated memory is still 190.8MB. Free memory was 134.2MB in the beginning and 98.6MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 11856.64ms. Allocated memory was 190.8MB in the beginning and 490.7MB in the end (delta: 299.9MB). Free memory was 97.5MB in the beginning and 367.2MB in the end (delta: -269.7MB). Peak memory consumption was 31.3MB. 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L718] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L719] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L721] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L723] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L724] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L725] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L726] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L727] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L728] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L729] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L730] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L731] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L732] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L733] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L734] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L735] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L736] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L737] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L739] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L741] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L742] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L743] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L830] 0 pthread_t t1019; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1019={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L831] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1019, ((void *)0), P0, ((void *)0))=-2, t1019={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] 0 pthread_t t1020; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L833] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1020, ((void *)0), P1, ((void *)0))=-1, t1019={5:0}, t1020={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] 0 pthread_t t1021; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1021, ((void *)0), P2, ((void *)0))=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 2 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L776] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L754] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L755] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L757] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L782] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L783] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L784] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L785] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L786] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L837] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L839] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L839] RET 0 assume_abort_if_not(main$tmp_guard0) [L841] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L848] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L849] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L850] 0 x$flush_delayed = weak$$choice2 [L851] 0 x$mem_tmp = x [L852] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L853] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L854] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L855] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L856] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L857] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L858] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L860] 0 x = x$flush_delayed ? x$mem_tmp : x [L861] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 831]: 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: 833]: 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: 835]: 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, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.1s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 846 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 846 mSDsluCounter, 911 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 743 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1670 IncrementalHoareTripleChecker+Invalid, 1787 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 168 mSDtfsCounter, 1670 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3586occurred in iteration=7, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 11249 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 1034 NumberOfCodeBlocks, 1034 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 934 ConstructedInterpolants, 0 QuantifiedInterpolants, 6224 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-11 23:37:52,074 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...