/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 21:04:39,545 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 21:04:39,546 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 21:04:39,590 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 21:04:39,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 21:04:39,593 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 21:04:39,596 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 21:04:39,600 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 21:04:39,604 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 21:04:39,608 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 21:04:39,609 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 21:04:39,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 21:04:39,610 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 21:04:39,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 21:04:39,611 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 21:04:39,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 21:04:39,612 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 21:04:39,612 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 21:04:39,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 21:04:39,615 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 21:04:39,615 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 21:04:39,620 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 21:04:39,621 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 21:04:39,623 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 21:04:39,630 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 21:04:39,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 21:04:39,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 21:04:39,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 21:04:39,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 21:04:39,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 21:04:39,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 21:04:39,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 21:04:39,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 21:04:39,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 21:04:39,637 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 21:04:39,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 21:04:39,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 21:04:39,637 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 21:04:39,637 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 21:04:39,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 21:04:39,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 21:04:39,639 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-11 21:04:39,666 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 21:04:39,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 21:04:39,668 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 21:04:39,668 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 21:04:39,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 21:04:39,669 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 21:04:39,669 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 21:04:39,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 21:04:39,669 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 21:04:39,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 21:04:39,670 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 21:04:39,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 21:04:39,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 21:04:39,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 21:04:39,670 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 21:04:39,670 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 21:04:39,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 21:04:39,671 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 21:04:39,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 21:04:39,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 21:04:39,671 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 21:04:39,671 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 21:04:39,671 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 21:04:39,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 21:04:39,671 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 21:04:39,672 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 21:04:39,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 21:04:39,672 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 21:04:39,672 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 21:04:39,672 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 21:04:39,672 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 21:04:39,672 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-11 21:04:39,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 21:04:39,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 21:04:39,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 21:04:39,957 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 21:04:39,958 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 21:04:39,959 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2022-12-11 21:04:41,111 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 21:04:41,396 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 21:04:41,397 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2022-12-11 21:04:41,421 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a24344b/f568faae262f4a4f943eecd69850fbb5/FLAGc003d3a32 [2022-12-11 21:04:41,434 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a24344b/f568faae262f4a4f943eecd69850fbb5 [2022-12-11 21:04:41,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 21:04:41,436 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 21:04:41,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 21:04:41,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 21:04:41,439 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 21:04:41,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 09:04:41" (1/1) ... [2022-12-11 21:04:41,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f8b545d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:41, skipping insertion in model container [2022-12-11 21:04:41,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 09:04:41" (1/1) ... [2022-12-11 21:04:41,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 21:04:41,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 21:04:41,612 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/safe031_power.oepc_pso.oepc_rmo.oepc.i[1013,1026] [2022-12-11 21:04:41,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 21:04:41,796 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 21:04:41,804 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/safe031_power.oepc_pso.oepc_rmo.oepc.i[1013,1026] [2022-12-11 21:04:41,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:04:41,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:04:41,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 21:04:41,892 INFO L208 MainTranslator]: Completed translation [2022-12-11 21:04:41,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:41 WrapperNode [2022-12-11 21:04:41,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 21:04:41,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 21:04:41,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 21:04:41,894 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 21:04:41,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:41" (1/1) ... [2022-12-11 21:04:41,923 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:41" (1/1) ... [2022-12-11 21:04:41,944 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2022-12-11 21:04:41,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 21:04:41,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 21:04:41,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 21:04:41,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 21:04:41,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:41" (1/1) ... [2022-12-11 21:04:41,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:41" (1/1) ... [2022-12-11 21:04:41,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:41" (1/1) ... [2022-12-11 21:04:41,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:41" (1/1) ... [2022-12-11 21:04:41,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:41" (1/1) ... [2022-12-11 21:04:41,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:41" (1/1) ... [2022-12-11 21:04:41,967 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:41" (1/1) ... [2022-12-11 21:04:41,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:41" (1/1) ... [2022-12-11 21:04:41,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 21:04:41,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 21:04:41,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 21:04:41,970 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 21:04:41,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:41" (1/1) ... [2022-12-11 21:04:41,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 21:04:41,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:04:41,993 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-11 21:04:41,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-11 21:04:42,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 21:04:42,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 21:04:42,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 21:04:42,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 21:04:42,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 21:04:42,020 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 21:04:42,020 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 21:04:42,020 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 21:04:42,021 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 21:04:42,021 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 21:04:42,021 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 21:04:42,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 21:04:42,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 21:04:42,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 21:04:42,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 21:04:42,022 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 21:04:42,162 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 21:04:42,163 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 21:04:42,388 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 21:04:42,503 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 21:04:42,503 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 21:04:42,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 09:04:42 BoogieIcfgContainer [2022-12-11 21:04:42,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 21:04:42,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 21:04:42,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 21:04:42,512 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 21:04:42,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 09:04:41" (1/3) ... [2022-12-11 21:04:42,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eec196a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 09:04:42, skipping insertion in model container [2022-12-11 21:04:42,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:04:41" (2/3) ... [2022-12-11 21:04:42,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eec196a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 09:04:42, skipping insertion in model container [2022-12-11 21:04:42,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 09:04:42" (3/3) ... [2022-12-11 21:04:42,514 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.oepc_pso.oepc_rmo.oepc.i [2022-12-11 21:04:42,526 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 21:04:42,526 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 21:04:42,526 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 21:04:42,574 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 21:04:42,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-11 21:04:42,676 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-11 21:04:42,676 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 21:04:42,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-11 21:04:42,684 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-11 21:04:42,687 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-11 21:04:42,705 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 21:04:42,735 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;@1c5a5c92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 21:04:42,748 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-11 21:04:42,762 INFO L130 PetriNetUnfolder]: 0/55 cut-off events. [2022-12-11 21:04:42,763 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 21:04:42,766 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:42,767 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:42,767 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:42,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:42,784 INFO L85 PathProgramCache]: Analyzing trace with hash 12741190, now seen corresponding path program 1 times [2022-12-11 21:04:42,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:42,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766957554] [2022-12-11 21:04:42,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:42,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:43,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:04:43,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:43,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766957554] [2022-12-11 21:04:43,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766957554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:43,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:43,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 21:04:43,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542945938] [2022-12-11 21:04:43,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:43,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 21:04:43,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:43,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 21:04:43,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 21:04:43,368 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 106 [2022-12-11 21:04:43,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:43,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:43,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 106 [2022-12-11 21:04:43,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:43,506 INFO L130 PetriNetUnfolder]: 37/274 cut-off events. [2022-12-11 21:04:43,506 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-11 21:04:43,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 274 events. 37/274 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1057 event pairs, 19 based on Foata normal form. 9/261 useless extension candidates. Maximal degree in co-relation 319. Up to 51 conditions per place. [2022-12-11 21:04:43,512 INFO L137 encePairwiseOnDemand]: 101/106 looper letters, 11 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2022-12-11 21:04:43,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 103 transitions, 244 flow [2022-12-11 21:04:43,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 21:04:43,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 21:04:43,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2022-12-11 21:04:43,531 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9339622641509434 [2022-12-11 21:04:43,534 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 0 predicate places. [2022-12-11 21:04:43,534 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 103 transitions, 244 flow [2022-12-11 21:04:43,537 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 244 flow [2022-12-11 21:04:43,538 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 103 transitions, 244 flow [2022-12-11 21:04:43,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:43,539 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:43,539 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:43,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 21:04:43,540 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:43,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:43,540 INFO L85 PathProgramCache]: Analyzing trace with hash 775572881, now seen corresponding path program 1 times [2022-12-11 21:04:43,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:43,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49529440] [2022-12-11 21:04:43,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:43,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:43,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:04:43,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:43,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49529440] [2022-12-11 21:04:43,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49529440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:43,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:43,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:04:43,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630698761] [2022-12-11 21:04:43,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:43,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:04:43,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:43,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:04:43,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:04:43,922 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 106 [2022-12-11 21:04:43,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 244 flow. Second operand has 7 states, 7 states have (on average 81.85714285714286) internal successors, (573), 7 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:43,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:43,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 106 [2022-12-11 21:04:43,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:44,573 INFO L130 PetriNetUnfolder]: 1703/4155 cut-off events. [2022-12-11 21:04:44,573 INFO L131 PetriNetUnfolder]: For 883/2146 co-relation queries the response was YES. [2022-12-11 21:04:44,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7972 conditions, 4155 events. 1703/4155 cut-off events. For 883/2146 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 34473 event pairs, 157 based on Foata normal form. 2/4032 useless extension candidates. Maximal degree in co-relation 7918. Up to 993 conditions per place. [2022-12-11 21:04:44,590 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 42 selfloop transitions, 9 changer transitions 103/222 dead transitions. [2022-12-11 21:04:44,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 222 transitions, 898 flow [2022-12-11 21:04:44,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:04:44,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:04:44,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1164 transitions. [2022-12-11 21:04:44,593 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8447024673439768 [2022-12-11 21:04:44,594 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 12 predicate places. [2022-12-11 21:04:44,594 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 222 transitions, 898 flow [2022-12-11 21:04:44,602 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 119 transitions, 414 flow [2022-12-11 21:04:44,603 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 119 transitions, 414 flow [2022-12-11 21:04:44,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.85714285714286) internal successors, (573), 7 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:44,603 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:44,603 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:44,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 21:04:44,603 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:44,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:44,604 INFO L85 PathProgramCache]: Analyzing trace with hash 93286576, now seen corresponding path program 1 times [2022-12-11 21:04:44,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:44,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102024448] [2022-12-11 21:04:44,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:44,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:44,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:04:44,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:44,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102024448] [2022-12-11 21:04:44,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102024448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:44,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:44,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 21:04:44,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114301948] [2022-12-11 21:04:44,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:44,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 21:04:44,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:44,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 21:04:44,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 21:04:44,755 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 106 [2022-12-11 21:04:44,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 119 transitions, 414 flow. Second operand has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:44,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:44,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 106 [2022-12-11 21:04:44,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:45,151 INFO L130 PetriNetUnfolder]: 1096/2465 cut-off events. [2022-12-11 21:04:45,151 INFO L131 PetriNetUnfolder]: For 970/5572 co-relation queries the response was YES. [2022-12-11 21:04:45,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6683 conditions, 2465 events. 1096/2465 cut-off events. For 970/5572 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 17744 event pairs, 72 based on Foata normal form. 65/2463 useless extension candidates. Maximal degree in co-relation 6625. Up to 930 conditions per place. [2022-12-11 21:04:45,162 INFO L137 encePairwiseOnDemand]: 99/106 looper letters, 53 selfloop transitions, 6 changer transitions 79/214 dead transitions. [2022-12-11 21:04:45,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 214 transitions, 1198 flow [2022-12-11 21:04:45,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 21:04:45,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 21:04:45,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 819 transitions. [2022-12-11 21:04:45,165 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8584905660377359 [2022-12-11 21:04:45,166 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 1 predicate places. [2022-12-11 21:04:45,166 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 214 transitions, 1198 flow [2022-12-11 21:04:45,174 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 135 transitions, 634 flow [2022-12-11 21:04:45,174 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 135 transitions, 634 flow [2022-12-11 21:04:45,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:45,174 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:45,175 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:45,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 21:04:45,175 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:45,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:45,176 INFO L85 PathProgramCache]: Analyzing trace with hash -767628401, now seen corresponding path program 1 times [2022-12-11 21:04:45,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:45,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088516858] [2022-12-11 21:04:45,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:45,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:45,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:04:45,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:45,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088516858] [2022-12-11 21:04:45,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088516858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:45,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:45,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 21:04:45,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595750828] [2022-12-11 21:04:45,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:45,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 21:04:45,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:45,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 21:04:45,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 21:04:45,368 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 106 [2022-12-11 21:04:45,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 135 transitions, 634 flow. Second operand has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:45,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:45,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 106 [2022-12-11 21:04:45,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:45,740 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([327] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][176], [P0Thread1of1ForFork1InUse, 170#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, 15#L812true, 61#L743true, 143#true, 123#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 66#L4true, 117#true, 58#L782true, P2Thread1of1ForFork0InUse]) [2022-12-11 21:04:45,740 INFO L382 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-12-11 21:04:45,740 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-11 21:04:45,740 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-11 21:04:45,740 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-11 21:04:45,741 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([312] L743-->L761: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and (= (mod v_~x$w_buff1_used~0_113 256) 0) .cse10)) (.cse12 (= (mod v_~x$w_buff0_used~0_128 256) 0)) (.cse6 (and .cse10 .cse8))) (let ((.cse2 (or .cse4 .cse12 .cse6)) (.cse3 (and .cse11 (not .cse12)))) (let ((.cse0 (ite .cse2 v_~x~0_69 (ite .cse3 v_~x$w_buff0~0_51 v_~x$w_buff1~0_50))) (.cse1 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse9 (= 0 (mod v_~x$w_buff1_used~0_112 256))) (.cse5 (= (mod v_~x$w_buff0_used~0_127 256) 0))) (and (= v_~x$flush_delayed~0_19 0) (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_9) (= .cse0 v_~__unbuffered_p0_EAX~0_14) (= (ite .cse1 v_~x$w_buff0_used~0_128 (ite .cse2 v_~x$w_buff0_used~0_128 (ite .cse3 0 v_~x$w_buff0_used~0_128))) v_~x$w_buff0_used~0_127) (= v_~x$w_buff1_used~0_112 (ite .cse1 v_~x$w_buff1_used~0_113 (ite (or .cse4 .cse5 .cse6) v_~x$w_buff1_used~0_113 0))) (= v_~x$w_buff0~0_51 v_~x$w_buff0~0_50) (= v_~x~0_68 (ite .cse1 v_~x$mem_tmp~0_18 .cse0)) (= v_~x$w_buff1~0_49 v_~x$w_buff1~0_50) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_38) (= v_~x~0_69 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd1~0_49 (ite .cse1 v_~x$r_buff1_thd1~0_50 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_49 256) 0))) (or (and .cse7 .cse8) (and .cse7 .cse9) .cse5)) v_~x$r_buff1_thd1~0_50 0))) (= v_~x$r_buff0_thd1~0_49 (ite .cse1 v_~x$r_buff0_thd1~0_50 (ite (or (and .cse9 .cse10) .cse5 .cse6) v_~x$r_buff0_thd1~0_50 (ite (and .cse11 (not .cse5)) 0 v_~x$r_buff0_thd1~0_50))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_113, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_112, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_38, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4][173], [120#true, P0Thread1of1ForFork1InUse, 170#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, 143#true, 70#L761true, 11#L805true, 66#L4true, 117#true, 58#L782true, P2Thread1of1ForFork0InUse]) [2022-12-11 21:04:45,741 INFO L382 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-12-11 21:04:45,741 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-11 21:04:45,741 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-11 21:04:45,741 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-11 21:04:45,791 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([320] L785-->L792: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0)))) (let ((.cse2 (and .cse4 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_112) v_~x$w_buff0_used~0_111) (= v_~x$w_buff1_used~0_98 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_99)) (= v_~x$r_buff0_thd2~0_24 (ite .cse2 0 v_~x$r_buff0_thd2~0_25)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)))) 0 v_~x$r_buff1_thd2~0_22)) (= (ite .cse0 v_~x$w_buff0~0_36 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][174], [P0Thread1of1ForFork1InUse, 170#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, 61#L743true, 143#true, 123#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 11#L805true, 66#L4true, 62#L792true, 117#true, P2Thread1of1ForFork0InUse]) [2022-12-11 21:04:45,791 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-11 21:04:45,791 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-11 21:04:45,791 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-11 21:04:45,791 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-11 21:04:45,791 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([327] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][176], [P0Thread1of1ForFork1InUse, 170#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, 15#L812true, 61#L743true, 143#true, 14#L785true, 123#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 66#L4true, 117#true, P2Thread1of1ForFork0InUse]) [2022-12-11 21:04:45,791 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-11 21:04:45,791 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-11 21:04:45,792 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-11 21:04:45,792 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-11 21:04:45,792 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([312] L743-->L761: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and (= (mod v_~x$w_buff1_used~0_113 256) 0) .cse10)) (.cse12 (= (mod v_~x$w_buff0_used~0_128 256) 0)) (.cse6 (and .cse10 .cse8))) (let ((.cse2 (or .cse4 .cse12 .cse6)) (.cse3 (and .cse11 (not .cse12)))) (let ((.cse0 (ite .cse2 v_~x~0_69 (ite .cse3 v_~x$w_buff0~0_51 v_~x$w_buff1~0_50))) (.cse1 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse9 (= 0 (mod v_~x$w_buff1_used~0_112 256))) (.cse5 (= (mod v_~x$w_buff0_used~0_127 256) 0))) (and (= v_~x$flush_delayed~0_19 0) (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_9) (= .cse0 v_~__unbuffered_p0_EAX~0_14) (= (ite .cse1 v_~x$w_buff0_used~0_128 (ite .cse2 v_~x$w_buff0_used~0_128 (ite .cse3 0 v_~x$w_buff0_used~0_128))) v_~x$w_buff0_used~0_127) (= v_~x$w_buff1_used~0_112 (ite .cse1 v_~x$w_buff1_used~0_113 (ite (or .cse4 .cse5 .cse6) v_~x$w_buff1_used~0_113 0))) (= v_~x$w_buff0~0_51 v_~x$w_buff0~0_50) (= v_~x~0_68 (ite .cse1 v_~x$mem_tmp~0_18 .cse0)) (= v_~x$w_buff1~0_49 v_~x$w_buff1~0_50) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_38) (= v_~x~0_69 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd1~0_49 (ite .cse1 v_~x$r_buff1_thd1~0_50 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_49 256) 0))) (or (and .cse7 .cse8) (and .cse7 .cse9) .cse5)) v_~x$r_buff1_thd1~0_50 0))) (= v_~x$r_buff0_thd1~0_49 (ite .cse1 v_~x$r_buff0_thd1~0_50 (ite (or (and .cse9 .cse10) .cse5 .cse6) v_~x$r_buff0_thd1~0_50 (ite (and .cse11 (not .cse5)) 0 v_~x$r_buff0_thd1~0_50))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_113, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_112, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_38, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4][173], [120#true, P0Thread1of1ForFork1InUse, 170#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, 143#true, 14#L785true, 70#L761true, 11#L805true, 66#L4true, 117#true, P2Thread1of1ForFork0InUse]) [2022-12-11 21:04:45,792 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-11 21:04:45,792 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-11 21:04:45,792 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-11 21:04:45,792 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-11 21:04:45,793 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([327] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][176], [P0Thread1of1ForFork1InUse, 170#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, 15#L812true, 74#L4-1true, 61#L743true, 143#true, 123#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 117#true, 58#L782true, P2Thread1of1ForFork0InUse]) [2022-12-11 21:04:45,793 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-11 21:04:45,793 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-11 21:04:45,793 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-11 21:04:45,793 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-11 21:04:45,793 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([312] L743-->L761: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and (= (mod v_~x$w_buff1_used~0_113 256) 0) .cse10)) (.cse12 (= (mod v_~x$w_buff0_used~0_128 256) 0)) (.cse6 (and .cse10 .cse8))) (let ((.cse2 (or .cse4 .cse12 .cse6)) (.cse3 (and .cse11 (not .cse12)))) (let ((.cse0 (ite .cse2 v_~x~0_69 (ite .cse3 v_~x$w_buff0~0_51 v_~x$w_buff1~0_50))) (.cse1 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse9 (= 0 (mod v_~x$w_buff1_used~0_112 256))) (.cse5 (= (mod v_~x$w_buff0_used~0_127 256) 0))) (and (= v_~x$flush_delayed~0_19 0) (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_9) (= .cse0 v_~__unbuffered_p0_EAX~0_14) (= (ite .cse1 v_~x$w_buff0_used~0_128 (ite .cse2 v_~x$w_buff0_used~0_128 (ite .cse3 0 v_~x$w_buff0_used~0_128))) v_~x$w_buff0_used~0_127) (= v_~x$w_buff1_used~0_112 (ite .cse1 v_~x$w_buff1_used~0_113 (ite (or .cse4 .cse5 .cse6) v_~x$w_buff1_used~0_113 0))) (= v_~x$w_buff0~0_51 v_~x$w_buff0~0_50) (= v_~x~0_68 (ite .cse1 v_~x$mem_tmp~0_18 .cse0)) (= v_~x$w_buff1~0_49 v_~x$w_buff1~0_50) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_38) (= v_~x~0_69 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd1~0_49 (ite .cse1 v_~x$r_buff1_thd1~0_50 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_49 256) 0))) (or (and .cse7 .cse8) (and .cse7 .cse9) .cse5)) v_~x$r_buff1_thd1~0_50 0))) (= v_~x$r_buff0_thd1~0_49 (ite .cse1 v_~x$r_buff0_thd1~0_50 (ite (or (and .cse9 .cse10) .cse5 .cse6) v_~x$r_buff0_thd1~0_50 (ite (and .cse11 (not .cse5)) 0 v_~x$r_buff0_thd1~0_50))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_113, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_112, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_38, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4][173], [120#true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 170#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 74#L4-1true, 143#true, 70#L761true, 11#L805true, 58#L782true, 117#true, P2Thread1of1ForFork0InUse]) [2022-12-11 21:04:45,793 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-11 21:04:45,793 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-11 21:04:45,793 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-11 21:04:45,793 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-11 21:04:45,840 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([320] L785-->L792: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0)))) (let ((.cse2 (and .cse4 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_112) v_~x$w_buff0_used~0_111) (= v_~x$w_buff1_used~0_98 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_99)) (= v_~x$r_buff0_thd2~0_24 (ite .cse2 0 v_~x$r_buff0_thd2~0_25)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)))) 0 v_~x$r_buff1_thd2~0_22)) (= (ite .cse0 v_~x$w_buff0~0_36 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][174], [P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 170#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 74#L4-1true, 61#L743true, 143#true, 123#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 11#L805true, 62#L792true, 117#true, P2Thread1of1ForFork0InUse]) [2022-12-11 21:04:45,840 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-11 21:04:45,840 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-11 21:04:45,840 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-11 21:04:45,841 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-11 21:04:45,841 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([327] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][176], [P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 170#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 74#L4-1true, 15#L812true, 61#L743true, 143#true, 14#L785true, 123#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 117#true, P2Thread1of1ForFork0InUse]) [2022-12-11 21:04:45,841 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-11 21:04:45,841 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-11 21:04:45,841 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-11 21:04:45,841 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-11 21:04:45,841 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([312] L743-->L761: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and (= (mod v_~x$w_buff1_used~0_113 256) 0) .cse10)) (.cse12 (= (mod v_~x$w_buff0_used~0_128 256) 0)) (.cse6 (and .cse10 .cse8))) (let ((.cse2 (or .cse4 .cse12 .cse6)) (.cse3 (and .cse11 (not .cse12)))) (let ((.cse0 (ite .cse2 v_~x~0_69 (ite .cse3 v_~x$w_buff0~0_51 v_~x$w_buff1~0_50))) (.cse1 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse9 (= 0 (mod v_~x$w_buff1_used~0_112 256))) (.cse5 (= (mod v_~x$w_buff0_used~0_127 256) 0))) (and (= v_~x$flush_delayed~0_19 0) (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_9) (= .cse0 v_~__unbuffered_p0_EAX~0_14) (= (ite .cse1 v_~x$w_buff0_used~0_128 (ite .cse2 v_~x$w_buff0_used~0_128 (ite .cse3 0 v_~x$w_buff0_used~0_128))) v_~x$w_buff0_used~0_127) (= v_~x$w_buff1_used~0_112 (ite .cse1 v_~x$w_buff1_used~0_113 (ite (or .cse4 .cse5 .cse6) v_~x$w_buff1_used~0_113 0))) (= v_~x$w_buff0~0_51 v_~x$w_buff0~0_50) (= v_~x~0_68 (ite .cse1 v_~x$mem_tmp~0_18 .cse0)) (= v_~x$w_buff1~0_49 v_~x$w_buff1~0_50) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_38) (= v_~x~0_69 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd1~0_49 (ite .cse1 v_~x$r_buff1_thd1~0_50 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_49 256) 0))) (or (and .cse7 .cse8) (and .cse7 .cse9) .cse5)) v_~x$r_buff1_thd1~0_50 0))) (= v_~x$r_buff0_thd1~0_49 (ite .cse1 v_~x$r_buff0_thd1~0_50 (ite (or (and .cse9 .cse10) .cse5 .cse6) v_~x$r_buff0_thd1~0_50 (ite (and .cse11 (not .cse5)) 0 v_~x$r_buff0_thd1~0_50))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_113, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_112, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_38, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4][173], [120#true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 170#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 74#L4-1true, 143#true, 14#L785true, 70#L761true, 11#L805true, 117#true, P2Thread1of1ForFork0InUse]) [2022-12-11 21:04:45,871 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-11 21:04:45,871 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-11 21:04:45,871 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-11 21:04:45,871 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-11 21:04:46,050 INFO L130 PetriNetUnfolder]: 3130/5789 cut-off events. [2022-12-11 21:04:46,050 INFO L131 PetriNetUnfolder]: For 11741/14383 co-relation queries the response was YES. [2022-12-11 21:04:46,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18014 conditions, 5789 events. 3130/5789 cut-off events. For 11741/14383 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 43185 event pairs, 71 based on Foata normal form. 232/5719 useless extension candidates. Maximal degree in co-relation 17952. Up to 2653 conditions per place. [2022-12-11 21:04:46,072 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 120 selfloop transitions, 15 changer transitions 52/271 dead transitions. [2022-12-11 21:04:46,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 271 transitions, 1934 flow [2022-12-11 21:04:46,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 21:04:46,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 21:04:46,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 911 transitions. [2022-12-11 21:04:46,074 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8594339622641509 [2022-12-11 21:04:46,075 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 4 predicate places. [2022-12-11 21:04:46,075 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 271 transitions, 1934 flow [2022-12-11 21:04:46,090 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 219 transitions, 1444 flow [2022-12-11 21:04:46,090 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 219 transitions, 1444 flow [2022-12-11 21:04:46,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:46,091 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:46,091 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:46,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 21:04:46,091 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:46,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:46,091 INFO L85 PathProgramCache]: Analyzing trace with hash 617785110, now seen corresponding path program 1 times [2022-12-11 21:04:46,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:46,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792101108] [2022-12-11 21:04:46,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:46,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:46,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:04:46,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:46,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792101108] [2022-12-11 21:04:46,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792101108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:46,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:46,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:04:46,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543610347] [2022-12-11 21:04:46,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:46,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:04:46,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:46,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:04:46,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:04:46,268 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 106 [2022-12-11 21:04:46,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 219 transitions, 1444 flow. Second operand has 7 states, 7 states have (on average 84.85714285714286) internal successors, (594), 7 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:46,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:46,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 106 [2022-12-11 21:04:46,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:46,801 INFO L130 PetriNetUnfolder]: 1890/4126 cut-off events. [2022-12-11 21:04:46,802 INFO L131 PetriNetUnfolder]: For 8535/12337 co-relation queries the response was YES. [2022-12-11 21:04:46,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14918 conditions, 4126 events. 1890/4126 cut-off events. For 8535/12337 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 33671 event pairs, 55 based on Foata normal form. 428/4394 useless extension candidates. Maximal degree in co-relation 14852. Up to 1442 conditions per place. [2022-12-11 21:04:46,814 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 130 selfloop transitions, 36 changer transitions 93/343 dead transitions. [2022-12-11 21:04:46,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 343 transitions, 2956 flow [2022-12-11 21:04:46,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:04:46,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:04:46,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1181 transitions. [2022-12-11 21:04:46,816 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8570391872278664 [2022-12-11 21:04:46,817 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 16 predicate places. [2022-12-11 21:04:46,817 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 343 transitions, 2956 flow [2022-12-11 21:04:46,853 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 250 transitions, 1960 flow [2022-12-11 21:04:46,853 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 250 transitions, 1960 flow [2022-12-11 21:04:46,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.85714285714286) internal successors, (594), 7 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:46,854 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:46,854 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:46,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 21:04:46,854 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:46,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:46,855 INFO L85 PathProgramCache]: Analyzing trace with hash -725643621, now seen corresponding path program 1 times [2022-12-11 21:04:46,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:46,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708835923] [2022-12-11 21:04:46,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:46,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:47,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:04:47,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:47,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708835923] [2022-12-11 21:04:47,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708835923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:47,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:47,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:04:47,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60472030] [2022-12-11 21:04:47,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:47,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:04:47,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:47,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:04:47,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:04:47,029 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 106 [2022-12-11 21:04:47,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 250 transitions, 1960 flow. Second operand has 7 states, 7 states have (on average 82.57142857142857) internal successors, (578), 7 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:47,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:47,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 106 [2022-12-11 21:04:47,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:47,659 INFO L130 PetriNetUnfolder]: 2369/5626 cut-off events. [2022-12-11 21:04:47,659 INFO L131 PetriNetUnfolder]: For 17585/25568 co-relation queries the response was YES. [2022-12-11 21:04:47,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21740 conditions, 5626 events. 2369/5626 cut-off events. For 17585/25568 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 52080 event pairs, 54 based on Foata normal form. 888/6354 useless extension candidates. Maximal degree in co-relation 21668. Up to 1831 conditions per place. [2022-12-11 21:04:47,717 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 131 selfloop transitions, 20 changer transitions 79/345 dead transitions. [2022-12-11 21:04:47,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 345 transitions, 3370 flow [2022-12-11 21:04:47,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:04:47,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:04:47,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1121 transitions. [2022-12-11 21:04:47,733 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8134978229317852 [2022-12-11 21:04:47,734 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 28 predicate places. [2022-12-11 21:04:47,734 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 345 transitions, 3370 flow [2022-12-11 21:04:47,745 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 266 transitions, 2414 flow [2022-12-11 21:04:47,745 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 266 transitions, 2414 flow [2022-12-11 21:04:47,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.57142857142857) internal successors, (578), 7 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:47,746 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:47,754 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:47,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 21:04:47,756 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:47,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:47,757 INFO L85 PathProgramCache]: Analyzing trace with hash -968251173, now seen corresponding path program 1 times [2022-12-11 21:04:47,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:47,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059779664] [2022-12-11 21:04:47,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:47,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:48,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:04:48,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:48,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059779664] [2022-12-11 21:04:48,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059779664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:48,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:48,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:04:48,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006068926] [2022-12-11 21:04:48,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:48,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:04:48,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:48,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:04:48,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:04:48,096 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 106 [2022-12-11 21:04:48,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 266 transitions, 2414 flow. Second operand has 7 states, 7 states have (on average 82.57142857142857) internal successors, (578), 7 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:48,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:48,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 106 [2022-12-11 21:04:48,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:49,129 INFO L130 PetriNetUnfolder]: 2385/6501 cut-off events. [2022-12-11 21:04:49,130 INFO L131 PetriNetUnfolder]: For 19255/30680 co-relation queries the response was YES. [2022-12-11 21:04:49,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24483 conditions, 6501 events. 2385/6501 cut-off events. For 19255/30680 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 67364 event pairs, 68 based on Foata normal form. 1038/7370 useless extension candidates. Maximal degree in co-relation 24405. Up to 1559 conditions per place. [2022-12-11 21:04:49,149 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 109 selfloop transitions, 20 changer transitions 94/338 dead transitions. [2022-12-11 21:04:49,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 338 transitions, 3794 flow [2022-12-11 21:04:49,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 21:04:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 21:04:49,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 623 transitions. [2022-12-11 21:04:49,151 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.839622641509434 [2022-12-11 21:04:49,151 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 25 predicate places. [2022-12-11 21:04:49,152 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 338 transitions, 3794 flow [2022-12-11 21:04:49,164 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 244 transitions, 2392 flow [2022-12-11 21:04:49,164 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 244 transitions, 2392 flow [2022-12-11 21:04:49,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.57142857142857) internal successors, (578), 7 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:49,165 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:49,165 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:49,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 21:04:49,165 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:49,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:49,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1827114425, now seen corresponding path program 2 times [2022-12-11 21:04:49,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:49,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140746148] [2022-12-11 21:04:49,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:49,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:49,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:04:49,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:49,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140746148] [2022-12-11 21:04:49,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140746148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:49,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:49,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 21:04:49,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878411470] [2022-12-11 21:04:49,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:49,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 21:04:49,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:49,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 21:04:49,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 21:04:49,366 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 106 [2022-12-11 21:04:49,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 244 transitions, 2392 flow. Second operand has 8 states, 8 states have (on average 84.875) internal successors, (679), 8 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:49,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:49,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 106 [2022-12-11 21:04:49,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:50,178 INFO L130 PetriNetUnfolder]: 1305/4007 cut-off events. [2022-12-11 21:04:50,178 INFO L131 PetriNetUnfolder]: For 9692/13070 co-relation queries the response was YES. [2022-12-11 21:04:50,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17020 conditions, 4007 events. 1305/4007 cut-off events. For 9692/13070 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 40338 event pairs, 42 based on Foata normal form. 442/4392 useless extension candidates. Maximal degree in co-relation 16938. Up to 862 conditions per place. [2022-12-11 21:04:50,189 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 28 selfloop transitions, 12 changer transitions 156/266 dead transitions. [2022-12-11 21:04:50,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 266 transitions, 2978 flow [2022-12-11 21:04:50,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 21:04:50,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 21:04:50,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1417 transitions. [2022-12-11 21:04:50,192 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8354952830188679 [2022-12-11 21:04:50,194 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 37 predicate places. [2022-12-11 21:04:50,194 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 266 transitions, 2978 flow [2022-12-11 21:04:50,199 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 110 transitions, 806 flow [2022-12-11 21:04:50,200 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 110 transitions, 806 flow [2022-12-11 21:04:50,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 84.875) internal successors, (679), 8 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:50,200 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:50,200 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:50,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 21:04:50,201 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:50,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:50,201 INFO L85 PathProgramCache]: Analyzing trace with hash 332614747, now seen corresponding path program 1 times [2022-12-11 21:04:50,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:50,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122610905] [2022-12-11 21:04:50,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:50,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:04:50,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:04:50,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:04:50,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122610905] [2022-12-11 21:04:50,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122610905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:04:50,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:04:50,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 21:04:50,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649479771] [2022-12-11 21:04:50,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:04:50,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 21:04:50,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:04:50,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 21:04:50,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-11 21:04:50,750 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 106 [2022-12-11 21:04:50,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 110 transitions, 806 flow. Second operand has 10 states, 10 states have (on average 82.1) internal successors, (821), 10 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:50,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:04:50,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 106 [2022-12-11 21:04:50,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:04:50,929 INFO L130 PetriNetUnfolder]: 109/410 cut-off events. [2022-12-11 21:04:50,930 INFO L131 PetriNetUnfolder]: For 1825/1985 co-relation queries the response was YES. [2022-12-11 21:04:50,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1810 conditions, 410 events. 109/410 cut-off events. For 1825/1985 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1975 event pairs, 9 based on Foata normal form. 8/410 useless extension candidates. Maximal degree in co-relation 1718. Up to 141 conditions per place. [2022-12-11 21:04:50,931 INFO L137 encePairwiseOnDemand]: 97/106 looper letters, 26 selfloop transitions, 4 changer transitions 24/127 dead transitions. [2022-12-11 21:04:50,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 127 transitions, 1189 flow [2022-12-11 21:04:50,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 21:04:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 21:04:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 834 transitions. [2022-12-11 21:04:50,933 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7867924528301887 [2022-12-11 21:04:50,934 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 24 predicate places. [2022-12-11 21:04:50,934 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 127 transitions, 1189 flow [2022-12-11 21:04:50,935 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 103 transitions, 747 flow [2022-12-11 21:04:50,935 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 103 transitions, 747 flow [2022-12-11 21:04:50,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 82.1) internal successors, (821), 10 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:04:50,936 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:04:50,936 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:50,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 21:04:50,936 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 21:04:50,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:04:50,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1394352491, now seen corresponding path program 2 times [2022-12-11 21:04:50,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:04:50,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843843221] [2022-12-11 21:04:50,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:04:50,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:04:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 21:04:50,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 21:04:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 21:04:51,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 21:04:51,045 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 21:04:51,046 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-11 21:04:51,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-11 21:04:51,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-11 21:04:51,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-11 21:04:51,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-11 21:04:51,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-11 21:04:51,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 21:04:51,050 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2022-12-11 21:04:51,054 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 21:04:51,054 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 21:04:51,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 09:04:51 BasicIcfg [2022-12-11 21:04:51,127 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 21:04:51,127 INFO L158 Benchmark]: Toolchain (without parser) took 9691.47ms. Allocated memory was 215.0MB in the beginning and 751.8MB in the end (delta: 536.9MB). Free memory was 189.9MB in the beginning and 652.5MB in the end (delta: -462.6MB). Peak memory consumption was 499.1MB. Max. memory is 8.0GB. [2022-12-11 21:04:51,128 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 215.0MB. Free memory was 191.0MB in the beginning and 190.9MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 21:04:51,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.90ms. Allocated memory is still 215.0MB. Free memory was 189.6MB in the beginning and 163.3MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-11 21:04:51,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.68ms. Allocated memory is still 215.0MB. Free memory was 163.3MB in the beginning and 161.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 21:04:51,128 INFO L158 Benchmark]: Boogie Preprocessor took 24.80ms. Allocated memory is still 215.0MB. Free memory was 161.2MB in the beginning and 159.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 21:04:51,128 INFO L158 Benchmark]: RCFGBuilder took 534.67ms. Allocated memory is still 215.0MB. Free memory was 159.1MB in the beginning and 126.1MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-11 21:04:51,129 INFO L158 Benchmark]: TraceAbstraction took 8620.61ms. Allocated memory was 215.0MB in the beginning and 751.8MB in the end (delta: 536.9MB). Free memory was 125.1MB in the beginning and 652.5MB in the end (delta: -527.5MB). Peak memory consumption was 434.1MB. Max. memory is 8.0GB. [2022-12-11 21:04:51,132 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 215.0MB. Free memory was 191.0MB in the beginning and 190.9MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 455.90ms. Allocated memory is still 215.0MB. Free memory was 189.6MB in the beginning and 163.3MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.68ms. Allocated memory is still 215.0MB. Free memory was 163.3MB in the beginning and 161.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.80ms. Allocated memory is still 215.0MB. Free memory was 161.2MB in the beginning and 159.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 534.67ms. Allocated memory is still 215.0MB. Free memory was 159.1MB in the beginning and 126.1MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 8620.61ms. Allocated memory was 215.0MB in the beginning and 751.8MB in the end (delta: 536.9MB). Free memory was 125.1MB in the beginning and 652.5MB in the end (delta: -527.5MB). Peak memory consumption was 434.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L714] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L716] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L718] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L719] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L720] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L721] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L722] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L723] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L724] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L725] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L726] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L727] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L728] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L729] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L730] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L731] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L732] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L734] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L737] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L738] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L829] 0 pthread_t t2513; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2513={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t2513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2513, ((void *)0), P0, ((void *)0))=-2, t2513={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L831] 0 pthread_t t2514; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t2514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2514, ((void *)0), P1, ((void *)0))=-1, t2513={5:0}, t2514={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [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)) [L19] 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_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t2515; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, t2515={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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t2515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2515, ((void *)0), P2, ((void *)0))=0, t2513={5:0}, t2514={6:0}, t2515={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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L801] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L807] 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) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 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 [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L742] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L787] 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) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 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 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 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_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, t2515={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 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) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 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 [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, t2515={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L847] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, t2515={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 132 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.1s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 589 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 589 mSDsluCounter, 470 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 367 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1020 IncrementalHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 103 mSDtfsCounter, 1020 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2414occurred in iteration=6, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 7506 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 727 NumberOfCodeBlocks, 727 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 636 ConstructedInterpolants, 0 QuantifiedInterpolants, 2439 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-11 21:04:51,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...