/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:23:30,615 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:23:30,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:23:30,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:23:30,664 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:23:30,666 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:23:30,668 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:23:30,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:23:30,676 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:23:30,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:23:30,682 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:23:30,682 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:23:30,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:23:30,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:23:30,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:23:30,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:23:30,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:23:30,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:23:30,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:23:30,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:23:30,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:23:30,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:23:30,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:23:30,696 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:23:30,703 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:23:30,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:23:30,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:23:30,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:23:30,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:23:30,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:23:30,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:23:30,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:23:30,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:23:30,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:23:30,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:23:30,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:23:30,712 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:23:30,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:23:30,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:23:30,713 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:23:30,714 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:23:30,716 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-SemanticLbe.epf [2022-12-05 20:23:30,745 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:23:30,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:23:30,746 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:23:30,747 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:23:30,747 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:23:30,748 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:23:30,748 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:23:30,748 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:23:30,748 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:23:30,748 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:23:30,749 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:23:30,749 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:23:30,749 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:23:30,749 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:23:30,749 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:23:30,750 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:23:30,750 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:23:30,750 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:23:30,750 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:23:30,750 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:23:30,750 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:23:30,750 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:23:30,750 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:23:30,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:23:30,751 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:23:30,751 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:23:30,751 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:23:30,751 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:23:30,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:23:30,751 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:23:30,751 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 20:23:31,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:23:31,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:23:31,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:23:31,040 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:23:31,040 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:23:31,041 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2022-12-05 20:23:32,021 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:23:32,243 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:23:32,243 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2022-12-05 20:23:32,262 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd2ff3f46/9f3d6e74cfb54b7298acbbfe411306f0/FLAGcd49fe1dc [2022-12-05 20:23:32,272 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd2ff3f46/9f3d6e74cfb54b7298acbbfe411306f0 [2022-12-05 20:23:32,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:23:32,275 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:23:32,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:23:32,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:23:32,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:23:32,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:23:32" (1/1) ... [2022-12-05 20:23:32,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ace0ddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:32, skipping insertion in model container [2022-12-05 20:23:32,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:23:32" (1/1) ... [2022-12-05 20:23:32,282 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:23:32,314 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:23:32,415 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/mix044_tso.oepc.i[949,962] [2022-12-05 20:23:32,554 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,554 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,555 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,555 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,555 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,562 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,607 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:23:32,626 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:23:32,633 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/mix044_tso.oepc.i[949,962] [2022-12-05 20:23:32,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:32,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:32,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:23:32,726 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:23:32,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:32 WrapperNode [2022-12-05 20:23:32,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:23:32,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:23:32,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:23:32,728 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:23:32,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:32" (1/1) ... [2022-12-05 20:23:32,747 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:32" (1/1) ... [2022-12-05 20:23:32,769 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2022-12-05 20:23:32,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:23:32,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:23:32,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:23:32,770 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:23:32,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:32" (1/1) ... [2022-12-05 20:23:32,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:32" (1/1) ... [2022-12-05 20:23:32,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:32" (1/1) ... [2022-12-05 20:23:32,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:32" (1/1) ... [2022-12-05 20:23:32,798 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:32" (1/1) ... [2022-12-05 20:23:32,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:32" (1/1) ... [2022-12-05 20:23:32,801 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:32" (1/1) ... [2022-12-05 20:23:32,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:32" (1/1) ... [2022-12-05 20:23:32,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:23:32,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:23:32,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:23:32,807 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:23:32,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:32" (1/1) ... [2022-12-05 20:23:32,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:23:32,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:23:32,849 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-05 20:23:32,869 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-05 20:23:32,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:23:32,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 20:23:32,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:23:32,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:23:32,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:23:32,882 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 20:23:32,882 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 20:23:32,882 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 20:23:32,883 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 20:23:32,883 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 20:23:32,883 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 20:23:32,883 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 20:23:32,884 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 20:23:32,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:23:32,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 20:23:32,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:23:32,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:23:32,885 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 20:23:32,983 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:23:32,984 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:23:33,259 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:23:33,381 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:23:33,381 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 20:23:33,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:23:33 BoogieIcfgContainer [2022-12-05 20:23:33,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:23:33,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:23:33,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:23:33,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:23:33,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:23:32" (1/3) ... [2022-12-05 20:23:33,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20fe565e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:23:33, skipping insertion in model container [2022-12-05 20:23:33,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:32" (2/3) ... [2022-12-05 20:23:33,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20fe565e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:23:33, skipping insertion in model container [2022-12-05 20:23:33,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:23:33" (3/3) ... [2022-12-05 20:23:33,390 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i [2022-12-05 20:23:33,403 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:23:33,403 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:23:33,404 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:23:33,479 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:23:33,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2022-12-05 20:23:33,576 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-05 20:23:33,577 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:23:33,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-05 20:23:33,583 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2022-12-05 20:23:33,591 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2022-12-05 20:23:33,595 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:23:33,617 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-05 20:23:33,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2022-12-05 20:23:33,649 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-05 20:23:33,649 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:23:33,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-05 20:23:33,653 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-05 20:23:33,653 INFO L188 LiptonReduction]: Number of co-enabled transitions 3256 [2022-12-05 20:23:38,779 INFO L203 LiptonReduction]: Total number of compositions: 98 [2022-12-05 20:23:38,789 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:23:38,794 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;@39ff110d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:23:38,794 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 20:23:38,797 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-05 20:23:38,797 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:23:38,797 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:38,798 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 20:23:38,798 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:23:38,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:38,802 INFO L85 PathProgramCache]: Analyzing trace with hash 529998227, now seen corresponding path program 1 times [2022-12-05 20:23:38,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:38,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484620240] [2022-12-05 20:23:38,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:38,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:39,108 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-05 20:23:39,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:39,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484620240] [2022-12-05 20:23:39,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484620240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:39,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:39,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:23:39,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011698134] [2022-12-05 20:23:39,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:39,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:23:39,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:39,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:23:39,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:23:39,136 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2022-12-05 20:23:39,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-05 20:23:39,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:39,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2022-12-05 20:23:39,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:40,116 INFO L130 PetriNetUnfolder]: 6047/8809 cut-off events. [2022-12-05 20:23:40,117 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-12-05 20:23:40,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17201 conditions, 8809 events. 6047/8809 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 52687 event pairs, 1112 based on Foata normal form. 0/8064 useless extension candidates. Maximal degree in co-relation 17189. Up to 6556 conditions per place. [2022-12-05 20:23:40,160 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 39 selfloop transitions, 2 changer transitions 8/53 dead transitions. [2022-12-05 20:23:40,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 222 flow [2022-12-05 20:23:40,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:23:40,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:23:40,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-12-05 20:23:40,170 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2022-12-05 20:23:40,172 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 82 flow. Second operand 3 states and 66 transitions. [2022-12-05 20:23:40,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 222 flow [2022-12-05 20:23:40,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 216 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 20:23:40,177 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 68 flow [2022-12-05 20:23:40,178 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2022-12-05 20:23:40,181 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2022-12-05 20:23:40,181 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 68 flow [2022-12-05 20:23:40,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-05 20:23:40,181 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:40,182 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:40,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:23:40,182 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:23:40,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:40,190 INFO L85 PathProgramCache]: Analyzing trace with hash -2049311037, now seen corresponding path program 1 times [2022-12-05 20:23:40,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:40,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127153049] [2022-12-05 20:23:40,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:40,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:40,423 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-05 20:23:40,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:40,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127153049] [2022-12-05 20:23:40,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127153049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:40,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:40,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:23:40,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579645688] [2022-12-05 20:23:40,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:40,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:23:40,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:40,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:23:40,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:23:40,426 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2022-12-05 20:23:40,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-05 20:23:40,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:40,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2022-12-05 20:23:40,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:40,933 INFO L130 PetriNetUnfolder]: 3511/5043 cut-off events. [2022-12-05 20:23:40,933 INFO L131 PetriNetUnfolder]: For 325/325 co-relation queries the response was YES. [2022-12-05 20:23:40,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10377 conditions, 5043 events. 3511/5043 cut-off events. For 325/325 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 25850 event pairs, 1399 based on Foata normal form. 128/5153 useless extension candidates. Maximal degree in co-relation 10367. Up to 3009 conditions per place. [2022-12-05 20:23:40,955 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 33 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2022-12-05 20:23:40,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 39 transitions, 162 flow [2022-12-05 20:23:40,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:23:40,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:23:40,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-05 20:23:40,956 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2022-12-05 20:23:40,956 INFO L175 Difference]: Start difference. First operand has 43 places, 28 transitions, 68 flow. Second operand 3 states and 48 transitions. [2022-12-05 20:23:40,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 39 transitions, 162 flow [2022-12-05 20:23:40,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:23:40,958 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 72 flow [2022-12-05 20:23:40,958 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2022-12-05 20:23:40,959 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -7 predicate places. [2022-12-05 20:23:40,959 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 72 flow [2022-12-05 20:23:40,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-05 20:23:40,959 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:40,959 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:40,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:23:40,959 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:23:40,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:40,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1953780836, now seen corresponding path program 1 times [2022-12-05 20:23:40,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:40,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033238837] [2022-12-05 20:23:40,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:40,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:41,296 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-05 20:23:41,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:41,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033238837] [2022-12-05 20:23:41,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033238837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:41,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:41,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:23:41,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960145333] [2022-12-05 20:23:41,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:41,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:23:41,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:41,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:23:41,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:23:41,298 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-05 20:23:41,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-05 20:23:41,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:41,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-05 20:23:41,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:41,811 INFO L130 PetriNetUnfolder]: 4389/6154 cut-off events. [2022-12-05 20:23:41,811 INFO L131 PetriNetUnfolder]: For 458/458 co-relation queries the response was YES. [2022-12-05 20:23:41,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13083 conditions, 6154 events. 4389/6154 cut-off events. For 458/458 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 29792 event pairs, 2061 based on Foata normal form. 24/6163 useless extension candidates. Maximal degree in co-relation 13072. Up to 5641 conditions per place. [2022-12-05 20:23:41,838 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 40 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2022-12-05 20:23:41,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 203 flow [2022-12-05 20:23:41,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:23:41,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:23:41,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-05 20:23:41,840 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2022-12-05 20:23:41,840 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 72 flow. Second operand 3 states and 53 transitions. [2022-12-05 20:23:41,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 203 flow [2022-12-05 20:23:41,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 46 transitions, 197 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:23:41,841 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 87 flow [2022-12-05 20:23:41,841 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2022-12-05 20:23:41,842 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -6 predicate places. [2022-12-05 20:23:41,842 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 87 flow [2022-12-05 20:23:41,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-05 20:23:41,842 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:41,842 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:41,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:23:41,842 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:23:41,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:41,843 INFO L85 PathProgramCache]: Analyzing trace with hash 435502980, now seen corresponding path program 1 times [2022-12-05 20:23:41,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:41,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733356005] [2022-12-05 20:23:41,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:41,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:42,371 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-05 20:23:42,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:42,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733356005] [2022-12-05 20:23:42,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733356005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:42,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:42,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:23:42,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125418960] [2022-12-05 20:23:42,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:42,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:23:42,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:42,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:23:42,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:23:42,373 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-05 20:23:42,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-05 20:23:42,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:42,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-05 20:23:42,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:42,987 INFO L130 PetriNetUnfolder]: 4647/6730 cut-off events. [2022-12-05 20:23:42,988 INFO L131 PetriNetUnfolder]: For 1099/1099 co-relation queries the response was YES. [2022-12-05 20:23:43,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14954 conditions, 6730 events. 4647/6730 cut-off events. For 1099/1099 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 37323 event pairs, 889 based on Foata normal form. 24/6744 useless extension candidates. Maximal degree in co-relation 14942. Up to 5537 conditions per place. [2022-12-05 20:23:43,024 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 52 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2022-12-05 20:23:43,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 283 flow [2022-12-05 20:23:43,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:23:43,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:23:43,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-05 20:23:43,026 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-05 20:23:43,026 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 87 flow. Second operand 4 states and 72 transitions. [2022-12-05 20:23:43,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 283 flow [2022-12-05 20:23:43,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 62 transitions, 280 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:23:43,027 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 123 flow [2022-12-05 20:23:43,027 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2022-12-05 20:23:43,028 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2022-12-05 20:23:43,028 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 123 flow [2022-12-05 20:23:43,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-05 20:23:43,028 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:43,028 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:43,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:23:43,028 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:23:43,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:43,029 INFO L85 PathProgramCache]: Analyzing trace with hash 2074943821, now seen corresponding path program 1 times [2022-12-05 20:23:43,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:43,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516370781] [2022-12-05 20:23:43,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:43,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:43,280 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-05 20:23:43,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:43,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516370781] [2022-12-05 20:23:43,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516370781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:43,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:43,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:23:43,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23121453] [2022-12-05 20:23:43,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:43,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:23:43,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:43,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:23:43,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:23:43,282 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-05 20:23:43,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 123 flow. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-05 20:23:43,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:43,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-05 20:23:43,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:44,219 INFO L130 PetriNetUnfolder]: 9791/13192 cut-off events. [2022-12-05 20:23:44,220 INFO L131 PetriNetUnfolder]: For 6275/6275 co-relation queries the response was YES. [2022-12-05 20:23:44,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33366 conditions, 13192 events. 9791/13192 cut-off events. For 6275/6275 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 61031 event pairs, 3626 based on Foata normal form. 28/13220 useless extension candidates. Maximal degree in co-relation 33352. Up to 10897 conditions per place. [2022-12-05 20:23:44,406 INFO L137 encePairwiseOnDemand]: 23/35 looper letters, 62 selfloop transitions, 14 changer transitions 0/76 dead transitions. [2022-12-05 20:23:44,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 76 transitions, 396 flow [2022-12-05 20:23:44,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:23:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:23:44,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-05 20:23:44,411 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2022-12-05 20:23:44,411 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 123 flow. Second operand 4 states and 71 transitions. [2022-12-05 20:23:44,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 76 transitions, 396 flow [2022-12-05 20:23:44,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 76 transitions, 382 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 20:23:44,417 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 218 flow [2022-12-05 20:23:44,418 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2022-12-05 20:23:44,419 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 0 predicate places. [2022-12-05 20:23:44,419 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 218 flow [2022-12-05 20:23:44,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-05 20:23:44,419 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:44,420 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:44,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:23:44,420 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:23:44,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:44,420 INFO L85 PathProgramCache]: Analyzing trace with hash -738273439, now seen corresponding path program 2 times [2022-12-05 20:23:44,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:44,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797785554] [2022-12-05 20:23:44,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:44,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:44,778 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-05 20:23:44,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:44,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797785554] [2022-12-05 20:23:44,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797785554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:44,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:44,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:23:44,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932580193] [2022-12-05 20:23:44,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:44,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:23:44,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:44,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:23:44,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:23:44,782 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-05 20:23:44,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 218 flow. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-05 20:23:44,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:44,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-05 20:23:44,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:46,146 INFO L130 PetriNetUnfolder]: 10755/14500 cut-off events. [2022-12-05 20:23:46,146 INFO L131 PetriNetUnfolder]: For 10625/10625 co-relation queries the response was YES. [2022-12-05 20:23:46,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44418 conditions, 14500 events. 10755/14500 cut-off events. For 10625/10625 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 68888 event pairs, 3277 based on Foata normal form. 70/14570 useless extension candidates. Maximal degree in co-relation 44402. Up to 11241 conditions per place. [2022-12-05 20:23:46,226 INFO L137 encePairwiseOnDemand]: 23/35 looper letters, 80 selfloop transitions, 27 changer transitions 0/107 dead transitions. [2022-12-05 20:23:46,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 107 transitions, 700 flow [2022-12-05 20:23:46,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:23:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:23:46,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2022-12-05 20:23:46,228 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48 [2022-12-05 20:23:46,228 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 218 flow. Second operand 5 states and 84 transitions. [2022-12-05 20:23:46,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 107 transitions, 700 flow [2022-12-05 20:23:46,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 107 transitions, 683 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-05 20:23:46,241 INFO L231 Difference]: Finished difference. Result has 53 places, 65 transitions, 458 flow [2022-12-05 20:23:46,241 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=458, PETRI_PLACES=53, PETRI_TRANSITIONS=65} [2022-12-05 20:23:46,241 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 6 predicate places. [2022-12-05 20:23:46,241 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 65 transitions, 458 flow [2022-12-05 20:23:46,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-05 20:23:46,242 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:46,242 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:46,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:23:46,242 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:23:46,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:46,242 INFO L85 PathProgramCache]: Analyzing trace with hash -832536945, now seen corresponding path program 3 times [2022-12-05 20:23:46,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:46,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990325161] [2022-12-05 20:23:46,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:46,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:46,533 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-05 20:23:46,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:46,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990325161] [2022-12-05 20:23:46,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990325161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:46,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:46,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:23:46,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108865470] [2022-12-05 20:23:46,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:46,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:23:46,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:46,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:23:46,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:23:46,535 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-05 20:23:46,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 65 transitions, 458 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-05 20:23:46,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:46,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-05 20:23:46,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:47,491 INFO L130 PetriNetUnfolder]: 7342/10326 cut-off events. [2022-12-05 20:23:47,492 INFO L131 PetriNetUnfolder]: For 19564/19686 co-relation queries the response was YES. [2022-12-05 20:23:47,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38335 conditions, 10326 events. 7342/10326 cut-off events. For 19564/19686 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 54691 event pairs, 2613 based on Foata normal form. 145/10419 useless extension candidates. Maximal degree in co-relation 38315. Up to 7146 conditions per place. [2022-12-05 20:23:47,553 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 63 selfloop transitions, 20 changer transitions 0/91 dead transitions. [2022-12-05 20:23:47,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 91 transitions, 716 flow [2022-12-05 20:23:47,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:23:47,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:23:47,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-05 20:23:47,554 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-05 20:23:47,555 INFO L175 Difference]: Start difference. First operand has 53 places, 65 transitions, 458 flow. Second operand 4 states and 72 transitions. [2022-12-05 20:23:47,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 91 transitions, 716 flow [2022-12-05 20:23:47,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 91 transitions, 699 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-05 20:23:47,584 INFO L231 Difference]: Finished difference. Result has 56 places, 65 transitions, 501 flow [2022-12-05 20:23:47,584 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=501, PETRI_PLACES=56, PETRI_TRANSITIONS=65} [2022-12-05 20:23:47,584 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 9 predicate places. [2022-12-05 20:23:47,585 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 65 transitions, 501 flow [2022-12-05 20:23:47,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-05 20:23:47,585 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:47,585 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:47,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:23:47,585 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:23:47,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:47,585 INFO L85 PathProgramCache]: Analyzing trace with hash -15683061, now seen corresponding path program 1 times [2022-12-05 20:23:47,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:47,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76579111] [2022-12-05 20:23:47,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:47,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:47,994 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-05 20:23:47,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:47,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76579111] [2022-12-05 20:23:47,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76579111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:47,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:47,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:23:47,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384852036] [2022-12-05 20:23:47,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:47,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:23:47,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:47,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:23:47,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:23:47,995 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-05 20:23:47,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 65 transitions, 501 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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-05 20:23:47,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:47,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-05 20:23:47,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:48,744 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][64], [Black: 159#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff0_used~0 0) (= ~x~0 ~x$w_buff1~0)), 113#L813true, 189#true, Black: 195#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= 0 ~x$w_buff1_used~0)), 110#L793true, Black: 166#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 197#true, 69#$Ultimate##0true, P1Thread1of1ForFork3InUse, Black: 172#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 176#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 182#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 185#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0)), 82#L874true, Black: 181#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0)), Black: 155#(<= ~__unbuffered_p3_EAX~0 0), 121#L832true]) [2022-12-05 20:23:48,744 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-05 20:23:48,744 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-05 20:23:48,744 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-05 20:23:48,744 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-05 20:23:48,804 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][64], [Black: 159#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff0_used~0 0) (= ~x~0 ~x$w_buff1~0)), 113#L813true, 189#true, Black: 195#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= 0 ~x$w_buff1_used~0)), 110#L793true, Black: 166#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 197#true, 119#L763true, P1Thread1of1ForFork3InUse, Black: 172#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 176#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 21#L863-3true, Black: 182#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 185#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0)), Black: 181#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0)), Black: 155#(<= ~__unbuffered_p3_EAX~0 0), 121#L832true]) [2022-12-05 20:23:48,804 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-05 20:23:48,804 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-05 20:23:48,804 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-05 20:23:48,804 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-05 20:23:48,834 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][64], [113#L813true, Black: 159#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff0_used~0 0) (= ~x~0 ~x$w_buff1~0)), 189#true, Black: 195#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= 0 ~x$w_buff1_used~0)), 110#L793true, 88#L753true, Black: 166#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 197#true, P1Thread1of1ForFork3InUse, Black: 172#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 176#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 182#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 185#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0)), Black: 181#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0)), 82#L874true, Black: 155#(<= ~__unbuffered_p3_EAX~0 0), 121#L832true]) [2022-12-05 20:23:48,834 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-05 20:23:48,834 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-05 20:23:48,834 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-05 20:23:48,834 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-05 20:23:48,852 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][64], [Black: 159#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff0_used~0 0) (= ~x~0 ~x$w_buff1~0)), 113#L813true, 189#true, Black: 195#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= 0 ~x$w_buff1_used~0)), Black: 166#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), P2Thread1of1ForFork0InUse, 108#P1EXITtrue, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 197#true, 69#$Ultimate##0true, P1Thread1of1ForFork3InUse, Black: 172#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 176#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 182#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 185#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0)), 82#L874true, Black: 181#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0)), Black: 155#(<= ~__unbuffered_p3_EAX~0 0), 121#L832true]) [2022-12-05 20:23:48,852 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-05 20:23:48,852 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-05 20:23:48,852 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-05 20:23:48,853 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-05 20:23:48,903 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][64], [Black: 159#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff0_used~0 0) (= ~x~0 ~x$w_buff1~0)), 113#L813true, 189#true, Black: 195#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= 0 ~x$w_buff1_used~0)), Black: 166#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), P2Thread1of1ForFork0InUse, 108#P1EXITtrue, P0Thread1of1ForFork1InUse, 197#true, P3Thread1of1ForFork2InUse, 119#L763true, P1Thread1of1ForFork3InUse, Black: 172#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 176#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 21#L863-3true, Black: 182#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 185#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0)), Black: 181#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0)), Black: 155#(<= ~__unbuffered_p3_EAX~0 0), 121#L832true]) [2022-12-05 20:23:48,903 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-05 20:23:48,903 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:23:48,903 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:23:48,903 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:23:48,907 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][64], [113#L813true, Black: 159#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff0_used~0 0) (= ~x~0 ~x$w_buff1~0)), 189#true, Black: 195#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= 0 ~x$w_buff1_used~0)), 110#L793true, Black: 166#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 102#P0EXITtrue, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 197#true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, Black: 172#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 176#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 21#L863-3true, Black: 182#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 185#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0)), Black: 181#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0)), Black: 155#(<= ~__unbuffered_p3_EAX~0 0), 121#L832true]) [2022-12-05 20:23:48,908 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-05 20:23:48,908 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:23:48,908 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:23:48,908 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:23:48,908 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][64], [Black: 159#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff0_used~0 0) (= ~x~0 ~x$w_buff1~0)), 113#L813true, 114#L867true, 189#true, Black: 195#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= 0 ~x$w_buff1_used~0)), 110#L793true, Black: 166#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 197#true, P3Thread1of1ForFork2InUse, 119#L763true, P1Thread1of1ForFork3InUse, Black: 172#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 176#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 182#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 185#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0)), Black: 181#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0)), Black: 155#(<= ~__unbuffered_p3_EAX~0 0), 121#L832true]) [2022-12-05 20:23:48,909 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-05 20:23:48,909 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:23:48,909 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:23:48,909 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:23:48,911 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][64], [Black: 159#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff0_used~0 0) (= ~x~0 ~x$w_buff1~0)), 113#L813true, 189#true, Black: 195#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= 0 ~x$w_buff1_used~0)), 110#L793true, Black: 166#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 125#L756true, 197#true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, Black: 172#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 176#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 182#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 185#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0)), Black: 181#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0)), 82#L874true, Black: 155#(<= ~__unbuffered_p3_EAX~0 0), 121#L832true]) [2022-12-05 20:23:48,911 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-05 20:23:48,911 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:23:48,912 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:23:48,912 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:23:48,918 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][64], [Black: 159#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff0_used~0 0) (= ~x~0 ~x$w_buff1~0)), 113#L813true, 189#true, Black: 195#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= 0 ~x$w_buff1_used~0)), 102#P0EXITtrue, Black: 166#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 197#true, P1Thread1of1ForFork3InUse, Black: 172#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 176#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 22#L783true, Black: 182#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 185#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0)), Black: 181#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0)), 82#L874true, Black: 155#(<= ~__unbuffered_p3_EAX~0 0), 121#L832true]) [2022-12-05 20:23:48,919 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-05 20:23:48,919 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:23:48,919 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:23:48,919 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:23:48,934 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][64], [113#L813true, Black: 159#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff0_used~0 0) (= ~x~0 ~x$w_buff1~0)), 189#true, Black: 195#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= 0 ~x$w_buff1_used~0)), 88#L753true, Black: 166#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), P2Thread1of1ForFork0InUse, 108#P1EXITtrue, P0Thread1of1ForFork1InUse, 197#true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, Black: 172#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 176#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 182#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 185#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0)), Black: 181#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0)), 82#L874true, Black: 155#(<= ~__unbuffered_p3_EAX~0 0), 121#L832true]) [2022-12-05 20:23:48,934 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-05 20:23:48,934 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:23:48,934 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:23:48,934 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:23:48,975 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][64], [113#L813true, Black: 159#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff0_used~0 0) (= ~x~0 ~x$w_buff1~0)), 189#true, Black: 195#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= 0 ~x$w_buff1_used~0)), 110#L793true, Black: 166#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 197#true, P3Thread1of1ForFork2InUse, 119#L763true, P1Thread1of1ForFork3InUse, Black: 172#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 176#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 182#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 185#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0)), Black: 181#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0)), Black: 155#(<= ~__unbuffered_p3_EAX~0 0), 82#L874true, 121#L832true]) [2022-12-05 20:23:48,975 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-05 20:23:48,975 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:23:48,975 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:23:48,975 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:23:48,987 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][64], [113#L813true, Black: 159#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff0_used~0 0) (= ~x~0 ~x$w_buff1~0)), 189#true, Black: 195#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= 0 ~x$w_buff1_used~0)), 102#P0EXITtrue, Black: 166#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), P2Thread1of1ForFork0InUse, 108#P1EXITtrue, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 197#true, P1Thread1of1ForFork3InUse, Black: 172#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 176#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 21#L863-3true, Black: 182#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 185#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0)), Black: 181#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0)), Black: 155#(<= ~__unbuffered_p3_EAX~0 0), 121#L832true]) [2022-12-05 20:23:48,987 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-05 20:23:48,987 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:23:48,987 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:23:48,987 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:23:48,988 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][64], [Black: 159#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff0_used~0 0) (= ~x~0 ~x$w_buff1~0)), 113#L813true, 114#L867true, 189#true, Black: 195#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= 0 ~x$w_buff1_used~0)), Black: 166#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), P2Thread1of1ForFork0InUse, 108#P1EXITtrue, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 197#true, 119#L763true, P1Thread1of1ForFork3InUse, Black: 172#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 176#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 182#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 185#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0)), Black: 181#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0)), Black: 155#(<= ~__unbuffered_p3_EAX~0 0), 121#L832true]) [2022-12-05 20:23:48,988 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-05 20:23:48,988 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:23:48,988 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:23:48,988 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:23:48,990 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][64], [Black: 159#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff0_used~0 0) (= ~x~0 ~x$w_buff1~0)), 113#L813true, 189#true, Black: 195#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= 0 ~x$w_buff1_used~0)), Black: 166#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), P2Thread1of1ForFork0InUse, 108#P1EXITtrue, P0Thread1of1ForFork1InUse, 125#L756true, 197#true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, Black: 172#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 176#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 182#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 185#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0)), Black: 181#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0)), 82#L874true, Black: 155#(<= ~__unbuffered_p3_EAX~0 0), 121#L832true]) [2022-12-05 20:23:48,990 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-05 20:23:48,990 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:23:48,990 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:23:48,990 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:23:48,994 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][64], [Black: 159#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff0_used~0 0) (= ~x~0 ~x$w_buff1~0)), 113#L813true, 114#L867true, 189#true, Black: 195#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= 0 ~x$w_buff1_used~0)), 110#L793true, Black: 166#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 102#P0EXITtrue, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 197#true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, Black: 172#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 176#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 182#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 185#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0)), Black: 181#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0)), Black: 155#(<= ~__unbuffered_p3_EAX~0 0), 121#L832true]) [2022-12-05 20:23:48,994 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-05 20:23:48,994 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:23:48,994 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:23:48,994 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:23:49,020 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][64], [Black: 159#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff0_used~0 0) (= ~x~0 ~x$w_buff1~0)), 113#L813true, 189#true, Black: 195#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= 0 ~x$w_buff1_used~0)), 110#L793true, 102#P0EXITtrue, Black: 166#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 197#true, P1Thread1of1ForFork3InUse, Black: 172#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 176#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 182#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 185#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0)), Black: 181#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0)), 82#L874true, Black: 155#(<= ~__unbuffered_p3_EAX~0 0), 121#L832true]) [2022-12-05 20:23:49,020 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-05 20:23:49,020 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-05 20:23:49,020 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-05 20:23:49,021 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-05 20:23:49,032 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][64], [113#L813true, Black: 159#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff0_used~0 0) (= ~x~0 ~x$w_buff1~0)), 189#true, Black: 195#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= 0 ~x$w_buff1_used~0)), Black: 166#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), P2Thread1of1ForFork0InUse, 108#P1EXITtrue, P0Thread1of1ForFork1InUse, 197#true, P3Thread1of1ForFork2InUse, 119#L763true, P1Thread1of1ForFork3InUse, Black: 172#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 176#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 182#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 185#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0)), Black: 181#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0)), Black: 155#(<= ~__unbuffered_p3_EAX~0 0), 82#L874true, 121#L832true]) [2022-12-05 20:23:49,032 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-05 20:23:49,032 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-05 20:23:49,032 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-05 20:23:49,032 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-05 20:23:49,043 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][64], [Black: 159#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff0_used~0 0) (= ~x~0 ~x$w_buff1~0)), 113#L813true, 114#L867true, 189#true, Black: 195#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= 0 ~x$w_buff1_used~0)), Black: 166#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 102#P0EXITtrue, P2Thread1of1ForFork0InUse, 108#P1EXITtrue, P0Thread1of1ForFork1InUse, 197#true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, Black: 172#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 176#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 182#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 185#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0)), Black: 181#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0)), Black: 155#(<= ~__unbuffered_p3_EAX~0 0), 121#L832true]) [2022-12-05 20:23:49,044 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-05 20:23:49,044 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-05 20:23:49,044 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-05 20:23:49,044 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-05 20:23:49,061 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][64], [Black: 159#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$w_buff0_used~0 0) (= ~x~0 ~x$w_buff1~0)), 113#L813true, 189#true, Black: 195#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= 0 ~x$w_buff1_used~0)), Black: 166#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 102#P0EXITtrue, P2Thread1of1ForFork0InUse, 108#P1EXITtrue, P0Thread1of1ForFork1InUse, 197#true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, Black: 172#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 176#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 182#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 185#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0)), Black: 181#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0_used~0 0)), Black: 155#(<= ~__unbuffered_p3_EAX~0 0), 82#L874true, 121#L832true]) [2022-12-05 20:23:49,061 INFO L382 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-12-05 20:23:49,061 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-05 20:23:49,061 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-05 20:23:49,061 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-05 20:23:49,117 INFO L130 PetriNetUnfolder]: 8096/11340 cut-off events. [2022-12-05 20:23:49,117 INFO L131 PetriNetUnfolder]: For 29565/29857 co-relation queries the response was YES. [2022-12-05 20:23:49,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43301 conditions, 11340 events. 8096/11340 cut-off events. For 29565/29857 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 61079 event pairs, 1793 based on Foata normal form. 145/11238 useless extension candidates. Maximal degree in co-relation 43279. Up to 6327 conditions per place. [2022-12-05 20:23:49,201 INFO L137 encePairwiseOnDemand]: 26/35 looper letters, 73 selfloop transitions, 27 changer transitions 0/108 dead transitions. [2022-12-05 20:23:49,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 108 transitions, 862 flow [2022-12-05 20:23:49,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:23:49,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:23:49,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2022-12-05 20:23:49,202 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5314285714285715 [2022-12-05 20:23:49,202 INFO L175 Difference]: Start difference. First operand has 56 places, 65 transitions, 501 flow. Second operand 5 states and 93 transitions. [2022-12-05 20:23:49,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 108 transitions, 862 flow [2022-12-05 20:23:49,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 108 transitions, 822 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 20:23:49,237 INFO L231 Difference]: Finished difference. Result has 58 places, 69 transitions, 566 flow [2022-12-05 20:23:49,237 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=566, PETRI_PLACES=58, PETRI_TRANSITIONS=69} [2022-12-05 20:23:49,237 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 11 predicate places. [2022-12-05 20:23:49,238 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 69 transitions, 566 flow [2022-12-05 20:23:49,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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-05 20:23:49,238 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:49,238 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:49,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:23:49,238 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:23:49,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:49,238 INFO L85 PathProgramCache]: Analyzing trace with hash 269233931, now seen corresponding path program 1 times [2022-12-05 20:23:49,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:49,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906192380] [2022-12-05 20:23:49,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:49,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:49,353 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-05 20:23:49,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:49,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906192380] [2022-12-05 20:23:49,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906192380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:49,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:49,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:23:49,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445283131] [2022-12-05 20:23:49,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:49,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:23:49,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:49,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:23:49,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:23:49,356 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2022-12-05 20:23:49,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 69 transitions, 566 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-05 20:23:49,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:49,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2022-12-05 20:23:49,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:50,235 INFO L130 PetriNetUnfolder]: 6756/9840 cut-off events. [2022-12-05 20:23:50,235 INFO L131 PetriNetUnfolder]: For 40451/41200 co-relation queries the response was YES. [2022-12-05 20:23:50,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39808 conditions, 9840 events. 6756/9840 cut-off events. For 40451/41200 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 57229 event pairs, 929 based on Foata normal form. 1250/10959 useless extension candidates. Maximal degree in co-relation 39785. Up to 5748 conditions per place. [2022-12-05 20:23:50,293 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 169 selfloop transitions, 10 changer transitions 8/200 dead transitions. [2022-12-05 20:23:50,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 200 transitions, 2033 flow [2022-12-05 20:23:50,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:23:50,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:23:50,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-12-05 20:23:50,294 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5257142857142857 [2022-12-05 20:23:50,294 INFO L175 Difference]: Start difference. First operand has 58 places, 69 transitions, 566 flow. Second operand 5 states and 92 transitions. [2022-12-05 20:23:50,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 200 transitions, 2033 flow [2022-12-05 20:23:50,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 200 transitions, 1917 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 20:23:50,318 INFO L231 Difference]: Finished difference. Result has 62 places, 78 transitions, 614 flow [2022-12-05 20:23:50,318 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=614, PETRI_PLACES=62, PETRI_TRANSITIONS=78} [2022-12-05 20:23:50,318 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 15 predicate places. [2022-12-05 20:23:50,319 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 78 transitions, 614 flow [2022-12-05 20:23:50,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-05 20:23:50,319 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:50,319 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:50,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:23:50,319 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:23:50,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:50,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1988413041, now seen corresponding path program 1 times [2022-12-05 20:23:50,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:50,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52262523] [2022-12-05 20:23:50,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:50,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:50,443 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-05 20:23:50,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:50,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52262523] [2022-12-05 20:23:50,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52262523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:50,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:50,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:23:50,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446423764] [2022-12-05 20:23:50,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:50,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:23:50,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:50,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:23:50,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:23:50,444 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2022-12-05 20:23:50,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 78 transitions, 614 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-05 20:23:50,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:50,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2022-12-05 20:23:50,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:51,419 INFO L130 PetriNetUnfolder]: 5503/8231 cut-off events. [2022-12-05 20:23:51,419 INFO L131 PetriNetUnfolder]: For 34287/35052 co-relation queries the response was YES. [2022-12-05 20:23:51,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36758 conditions, 8231 events. 5503/8231 cut-off events. For 34287/35052 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 49047 event pairs, 441 based on Foata normal form. 923/9064 useless extension candidates. Maximal degree in co-relation 36732. Up to 2854 conditions per place. [2022-12-05 20:23:51,470 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 213 selfloop transitions, 19 changer transitions 13/258 dead transitions. [2022-12-05 20:23:51,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 258 transitions, 2557 flow [2022-12-05 20:23:51,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:23:51,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:23:51,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2022-12-05 20:23:51,472 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2022-12-05 20:23:51,472 INFO L175 Difference]: Start difference. First operand has 62 places, 78 transitions, 614 flow. Second operand 7 states and 131 transitions. [2022-12-05 20:23:51,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 258 transitions, 2557 flow [2022-12-05 20:23:51,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 258 transitions, 2552 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:23:51,514 INFO L231 Difference]: Finished difference. Result has 70 places, 86 transitions, 738 flow [2022-12-05 20:23:51,515 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=738, PETRI_PLACES=70, PETRI_TRANSITIONS=86} [2022-12-05 20:23:51,515 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 23 predicate places. [2022-12-05 20:23:51,515 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 86 transitions, 738 flow [2022-12-05 20:23:51,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-05 20:23:51,515 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:51,516 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:51,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:23:51,516 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:23:51,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:51,516 INFO L85 PathProgramCache]: Analyzing trace with hash -795100958, now seen corresponding path program 1 times [2022-12-05 20:23:51,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:51,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714222361] [2022-12-05 20:23:51,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:51,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:51,712 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-05 20:23:51,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:51,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714222361] [2022-12-05 20:23:51,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714222361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:51,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:51,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:23:51,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191232487] [2022-12-05 20:23:51,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:51,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:23:51,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:51,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:23:51,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:23:51,714 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2022-12-05 20:23:51,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 86 transitions, 738 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:23:51,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:51,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2022-12-05 20:23:51,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:52,675 INFO L130 PetriNetUnfolder]: 5145/7698 cut-off events. [2022-12-05 20:23:52,675 INFO L131 PetriNetUnfolder]: For 36397/37168 co-relation queries the response was YES. [2022-12-05 20:23:52,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37355 conditions, 7698 events. 5145/7698 cut-off events. For 36397/37168 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 46008 event pairs, 363 based on Foata normal form. 574/8187 useless extension candidates. Maximal degree in co-relation 37325. Up to 2543 conditions per place. [2022-12-05 20:23:52,734 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 224 selfloop transitions, 28 changer transitions 24/289 dead transitions. [2022-12-05 20:23:52,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 289 transitions, 2935 flow [2022-12-05 20:23:52,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 20:23:52,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 20:23:52,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2022-12-05 20:23:52,735 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-05 20:23:52,736 INFO L175 Difference]: Start difference. First operand has 70 places, 86 transitions, 738 flow. Second operand 9 states and 168 transitions. [2022-12-05 20:23:52,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 289 transitions, 2935 flow [2022-12-05 20:23:53,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 289 transitions, 2885 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-12-05 20:23:53,036 INFO L231 Difference]: Finished difference. Result has 78 places, 93 transitions, 831 flow [2022-12-05 20:23:53,036 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=831, PETRI_PLACES=78, PETRI_TRANSITIONS=93} [2022-12-05 20:23:53,036 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 31 predicate places. [2022-12-05 20:23:53,036 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 93 transitions, 831 flow [2022-12-05 20:23:53,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:23:53,037 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:53,037 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:53,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 20:23:53,037 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:23:53,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:53,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1704718668, now seen corresponding path program 1 times [2022-12-05 20:23:53,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:53,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125256100] [2022-12-05 20:23:53,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:53,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:53,310 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-05 20:23:53,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:53,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125256100] [2022-12-05 20:23:53,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125256100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:53,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:53,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:23:53,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023696694] [2022-12-05 20:23:53,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:53,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:23:53,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:53,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:23:53,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:23:53,314 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-05 20:23:53,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 93 transitions, 831 flow. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-05 20:23:53,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:53,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-05 20:23:53,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:54,936 INFO L130 PetriNetUnfolder]: 12331/17602 cut-off events. [2022-12-05 20:23:54,937 INFO L131 PetriNetUnfolder]: For 69878/69878 co-relation queries the response was YES. [2022-12-05 20:23:55,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81243 conditions, 17602 events. 12331/17602 cut-off events. For 69878/69878 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 100222 event pairs, 2099 based on Foata normal form. 14/17616 useless extension candidates. Maximal degree in co-relation 81210. Up to 9727 conditions per place. [2022-12-05 20:23:55,064 INFO L137 encePairwiseOnDemand]: 21/35 looper letters, 127 selfloop transitions, 53 changer transitions 120/300 dead transitions. [2022-12-05 20:23:55,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 300 transitions, 3181 flow [2022-12-05 20:23:55,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:23:55,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:23:55,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2022-12-05 20:23:55,066 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-05 20:23:55,066 INFO L175 Difference]: Start difference. First operand has 78 places, 93 transitions, 831 flow. Second operand 6 states and 108 transitions. [2022-12-05 20:23:55,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 300 transitions, 3181 flow [2022-12-05 20:23:56,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 300 transitions, 2820 flow, removed 122 selfloop flow, removed 4 redundant places. [2022-12-05 20:23:56,153 INFO L231 Difference]: Finished difference. Result has 84 places, 117 transitions, 1213 flow [2022-12-05 20:23:56,153 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1213, PETRI_PLACES=84, PETRI_TRANSITIONS=117} [2022-12-05 20:23:56,154 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 37 predicate places. [2022-12-05 20:23:56,154 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 117 transitions, 1213 flow [2022-12-05 20:23:56,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-05 20:23:56,154 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:56,154 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:56,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 20:23:56,154 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:23:56,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:56,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1417916496, now seen corresponding path program 2 times [2022-12-05 20:23:56,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:56,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283098608] [2022-12-05 20:23:56,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:56,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:56,315 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-05 20:23:56,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:56,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283098608] [2022-12-05 20:23:56,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283098608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:56,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:56,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 20:23:56,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746262237] [2022-12-05 20:23:56,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:56,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:23:56,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:56,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:23:56,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:23:56,317 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2022-12-05 20:23:56,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 117 transitions, 1213 flow. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:23:56,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:56,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2022-12-05 20:23:56,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:57,050 INFO L130 PetriNetUnfolder]: 3601/5469 cut-off events. [2022-12-05 20:23:57,050 INFO L131 PetriNetUnfolder]: For 34794/35343 co-relation queries the response was YES. [2022-12-05 20:23:57,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28923 conditions, 5469 events. 3601/5469 cut-off events. For 34794/35343 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 31251 event pairs, 496 based on Foata normal form. 174/5479 useless extension candidates. Maximal degree in co-relation 28884. Up to 2561 conditions per place. [2022-12-05 20:23:57,080 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 164 selfloop transitions, 18 changer transitions 51/251 dead transitions. [2022-12-05 20:23:57,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 251 transitions, 3043 flow [2022-12-05 20:23:57,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:23:57,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:23:57,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2022-12-05 20:23:57,082 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4392857142857143 [2022-12-05 20:23:57,082 INFO L175 Difference]: Start difference. First operand has 84 places, 117 transitions, 1213 flow. Second operand 8 states and 123 transitions. [2022-12-05 20:23:57,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 251 transitions, 3043 flow [2022-12-05 20:23:57,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 251 transitions, 2873 flow, removed 54 selfloop flow, removed 7 redundant places. [2022-12-05 20:23:57,164 INFO L231 Difference]: Finished difference. Result has 81 places, 104 transitions, 1023 flow [2022-12-05 20:23:57,164 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1099, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1023, PETRI_PLACES=81, PETRI_TRANSITIONS=104} [2022-12-05 20:23:57,165 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 34 predicate places. [2022-12-05 20:23:57,165 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 104 transitions, 1023 flow [2022-12-05 20:23:57,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:23:57,165 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:57,165 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:57,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 20:23:57,166 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:23:57,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:57,166 INFO L85 PathProgramCache]: Analyzing trace with hash -912288254, now seen corresponding path program 1 times [2022-12-05 20:23:57,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:57,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010700142] [2022-12-05 20:23:57,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:57,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:57,311 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-05 20:23:57,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:57,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010700142] [2022-12-05 20:23:57,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010700142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:57,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:57,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:23:57,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521297289] [2022-12-05 20:23:57,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:57,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:23:57,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:57,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:23:57,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:23:57,312 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-05 20:23:57,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 104 transitions, 1023 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-05 20:23:57,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:57,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-05 20:23:57,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:57,934 INFO L130 PetriNetUnfolder]: 4234/6499 cut-off events. [2022-12-05 20:23:57,934 INFO L131 PetriNetUnfolder]: For 32993/33139 co-relation queries the response was YES. [2022-12-05 20:23:57,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34141 conditions, 6499 events. 4234/6499 cut-off events. For 32993/33139 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 37023 event pairs, 431 based on Foata normal form. 99/6561 useless extension candidates. Maximal degree in co-relation 34114. Up to 3055 conditions per place. [2022-12-05 20:23:57,966 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 92 selfloop transitions, 1 changer transitions 96/196 dead transitions. [2022-12-05 20:23:57,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 196 transitions, 2273 flow [2022-12-05 20:23:57,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:23:57,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:23:57,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-05 20:23:57,984 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2022-12-05 20:23:57,984 INFO L175 Difference]: Start difference. First operand has 81 places, 104 transitions, 1023 flow. Second operand 4 states and 67 transitions. [2022-12-05 20:23:57,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 196 transitions, 2273 flow [2022-12-05 20:23:58,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 196 transitions, 2088 flow, removed 54 selfloop flow, removed 8 redundant places. [2022-12-05 20:23:58,059 INFO L231 Difference]: Finished difference. Result has 76 places, 78 transitions, 649 flow [2022-12-05 20:23:58,059 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=942, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=649, PETRI_PLACES=76, PETRI_TRANSITIONS=78} [2022-12-05 20:23:58,060 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2022-12-05 20:23:58,060 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 78 transitions, 649 flow [2022-12-05 20:23:58,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-05 20:23:58,060 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:58,060 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:58,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 20:23:58,060 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:23:58,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:58,061 INFO L85 PathProgramCache]: Analyzing trace with hash -401318996, now seen corresponding path program 2 times [2022-12-05 20:23:58,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:58,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640138557] [2022-12-05 20:23:58,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:58,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:58,323 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-05 20:23:58,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:58,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640138557] [2022-12-05 20:23:58,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640138557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:58,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:58,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:23:58,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140836292] [2022-12-05 20:23:58,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:58,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:23:58,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:58,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:23:58,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:23:58,325 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-05 20:23:58,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 78 transitions, 649 flow. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-05 20:23:58,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:58,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-05 20:23:58,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:58,720 INFO L130 PetriNetUnfolder]: 2645/4132 cut-off events. [2022-12-05 20:23:58,720 INFO L131 PetriNetUnfolder]: For 14075/14075 co-relation queries the response was YES. [2022-12-05 20:23:58,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19859 conditions, 4132 events. 2645/4132 cut-off events. For 14075/14075 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 21550 event pairs, 609 based on Foata normal form. 1/4133 useless extension candidates. Maximal degree in co-relation 19834. Up to 2157 conditions per place. [2022-12-05 20:23:58,737 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 59 selfloop transitions, 5 changer transitions 58/122 dead transitions. [2022-12-05 20:23:58,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 122 transitions, 1186 flow [2022-12-05 20:23:58,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:23:58,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:23:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-05 20:23:58,738 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38571428571428573 [2022-12-05 20:23:58,738 INFO L175 Difference]: Start difference. First operand has 76 places, 78 transitions, 649 flow. Second operand 4 states and 54 transitions. [2022-12-05 20:23:58,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 122 transitions, 1186 flow [2022-12-05 20:23:58,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 122 transitions, 1146 flow, removed 1 selfloop flow, removed 6 redundant places. [2022-12-05 20:23:58,772 INFO L231 Difference]: Finished difference. Result has 73 places, 52 transitions, 380 flow [2022-12-05 20:23:58,772 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=380, PETRI_PLACES=73, PETRI_TRANSITIONS=52} [2022-12-05 20:23:58,773 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 26 predicate places. [2022-12-05 20:23:58,773 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 52 transitions, 380 flow [2022-12-05 20:23:58,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-05 20:23:58,773 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:58,773 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:58,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 20:23:58,773 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:23:58,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:58,773 INFO L85 PathProgramCache]: Analyzing trace with hash 976646926, now seen corresponding path program 3 times [2022-12-05 20:23:58,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:58,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067570211] [2022-12-05 20:23:58,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:58,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:23:58,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 20:23:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:23:58,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 20:23:58,935 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 20:23:58,936 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-05 20:23:58,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-05 20:23:58,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-05 20:23:58,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-05 20:23:58,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-05 20:23:58,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-05 20:23:58,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-05 20:23:58,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-05 20:23:58,938 INFO L458 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:58,943 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:23:58,943 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:23:59,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:23:59 BasicIcfg [2022-12-05 20:23:59,020 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:23:59,022 INFO L158 Benchmark]: Toolchain (without parser) took 26746.24ms. Allocated memory was 192.9MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 167.8MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-05 20:23:59,022 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 192.9MB. Free memory is still 169.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:23:59,022 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.62ms. Allocated memory is still 192.9MB. Free memory was 167.6MB in the beginning and 138.7MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-05 20:23:59,023 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.33ms. Allocated memory is still 192.9MB. Free memory was 138.2MB in the beginning and 135.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 20:23:59,023 INFO L158 Benchmark]: Boogie Preprocessor took 34.39ms. Allocated memory is still 192.9MB. Free memory was 135.6MB in the beginning and 133.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:23:59,023 INFO L158 Benchmark]: RCFGBuilder took 577.37ms. Allocated memory is still 192.9MB. Free memory was 133.5MB in the beginning and 95.7MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-05 20:23:59,023 INFO L158 Benchmark]: TraceAbstraction took 25635.38ms. Allocated memory was 192.9MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 94.7MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-12-05 20:23:59,024 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 192.9MB. Free memory is still 169.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 451.62ms. Allocated memory is still 192.9MB. Free memory was 167.6MB in the beginning and 138.7MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.33ms. Allocated memory is still 192.9MB. Free memory was 138.2MB in the beginning and 135.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.39ms. Allocated memory is still 192.9MB. Free memory was 135.6MB in the beginning and 133.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 577.37ms. Allocated memory is still 192.9MB. Free memory was 133.5MB in the beginning and 95.7MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 25635.38ms. Allocated memory was 192.9MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 94.7MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 139 PlacesBefore, 47 PlacesAfterwards, 128 TransitionsBefore, 35 TransitionsAfterwards, 3256 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 53 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2630, independent: 2557, independent conditional: 2557, independent unconditional: 0, dependent: 73, dependent conditional: 73, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2630, independent: 2557, independent conditional: 0, independent unconditional: 2557, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2630, independent: 2557, independent conditional: 0, independent unconditional: 2557, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2630, independent: 2557, independent conditional: 0, independent unconditional: 2557, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2145, independent: 2087, independent conditional: 0, independent unconditional: 2087, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2145, independent: 2049, independent conditional: 0, independent unconditional: 2049, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 96, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 358, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2630, independent: 470, independent conditional: 0, independent unconditional: 470, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 2145, unknown conditional: 0, unknown unconditional: 2145] , Statistics on independence cache: Total cache size (in pairs): 3094, Positive cache size: 3036, Positive conditional cache size: 0, Positive unconditional cache size: 3036, Negative cache size: 58, Negative conditional cache size: 0, Negative unconditional cache size: 58, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1185; [L857] FCALL, FORK 0 pthread_create(&t1185, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1185, ((void *)0), P0, ((void *)0))=-2, t1185={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L858] 0 pthread_t t1186; [L859] FCALL, FORK 0 pthread_create(&t1186, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1186, ((void *)0), P1, ((void *)0))=-1, t1185={5:0}, t1186={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t1187; [L861] FCALL, FORK 0 pthread_create(&t1187, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1187, ((void *)0), P2, ((void *)0))=0, t1185={5:0}, t1186={6:0}, t1187={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t1188; [L863] FCALL, FORK 0 pthread_create(&t1188, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1188, ((void *)0), P3, ((void *)0))=1, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L822] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L758] 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) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 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 [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L788] 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) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 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 [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L834] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L835] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L836] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L837] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L838] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 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) [L870] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L871] 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 [L872] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L873] 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 [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L876] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L877] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L878] 0 x$flush_delayed = weak$$choice2 [L879] 0 x$mem_tmp = x [L880] 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) [L881] 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)) [L882] 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)) [L883] 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)) [L884] 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)) [L885] 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)) [L886] 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)) [L887] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] 0 x = x$flush_delayed ? x$mem_tmp : x [L889] 0 x$flush_delayed = (_Bool)0 [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - 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: 861]: 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: 857]: 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: 863]: 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: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 170 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 25.4s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 682 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 682 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1625 IncrementalHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 35 mSDtfsCounter, 1625 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1213occurred in iteration=12, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 289 NumberOfCodeBlocks, 289 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 246 ConstructedInterpolants, 0 QuantifiedInterpolants, 1745 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 20:23:59,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...