/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/mix046.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 21:00:20,773 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 21:00:20,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 21:00:20,808 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 21:00:20,809 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 21:00:20,811 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 21:00:20,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 21:00:20,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 21:00:20,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 21:00:20,823 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 21:00:20,843 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 21:00:20,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 21:00:20,845 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 21:00:20,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 21:00:20,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 21:00:20,850 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 21:00:20,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 21:00:20,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 21:00:20,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 21:00:20,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 21:00:20,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 21:00:20,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 21:00:20,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 21:00:20,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 21:00:20,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 21:00:20,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 21:00:20,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 21:00:20,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 21:00:20,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 21:00:20,867 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 21:00:20,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 21:00:20,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 21:00:20,868 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 21:00:20,869 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 21:00:20,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 21:00:20,870 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 21:00:20,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 21:00:20,870 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 21:00:20,870 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 21:00:20,871 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 21:00:20,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 21:00:20,874 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:00:20,896 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 21:00:20,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 21:00:20,898 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 21:00:20,898 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 21:00:20,898 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 21:00:20,899 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 21:00:20,899 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 21:00:20,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 21:00:20,899 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 21:00:20,900 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 21:00:20,900 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 21:00:20,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 21:00:20,900 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 21:00:20,900 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 21:00:20,901 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 21:00:20,901 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 21:00:20,901 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 21:00:20,901 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 21:00:20,901 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 21:00:20,901 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 21:00:20,901 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 21:00:20,901 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 21:00:20,901 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 21:00:20,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 21:00:20,902 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 21:00:20,902 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 21:00:20,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 21:00:20,902 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 21:00:20,902 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 21:00:20,902 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 21:00:20,902 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 21:00:20,902 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:00:21,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 21:00:21,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 21:00:21,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 21:00:21,154 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 21:00:21,154 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 21:00:21,155 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046.opt.i [2022-12-11 21:00:22,275 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 21:00:22,506 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 21:00:22,507 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046.opt.i [2022-12-11 21:00:22,525 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce51b5d2e/a04855476b384383b58c50b2e204f6b8/FLAGd6128e122 [2022-12-11 21:00:22,535 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce51b5d2e/a04855476b384383b58c50b2e204f6b8 [2022-12-11 21:00:22,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 21:00:22,545 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 21:00:22,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 21:00:22,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 21:00:22,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 21:00:22,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 09:00:22" (1/1) ... [2022-12-11 21:00:22,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f4cdba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:00:22, skipping insertion in model container [2022-12-11 21:00:22,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 09:00:22" (1/1) ... [2022-12-11 21:00:22,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 21:00:22,610 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 21:00:22,725 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/mix046.opt.i[944,957] [2022-12-11 21:00:22,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 21:00:22,915 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 21:00:22,929 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/mix046.opt.i[944,957] [2022-12-11 21:00:22,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:22,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:22,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 21:00:23,028 INFO L208 MainTranslator]: Completed translation [2022-12-11 21:00:23,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:00:23 WrapperNode [2022-12-11 21:00:23,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 21:00:23,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 21:00:23,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 21:00:23,031 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 21:00:23,035 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:00:23" (1/1) ... [2022-12-11 21:00:23,060 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:00:23" (1/1) ... [2022-12-11 21:00:23,089 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2022-12-11 21:00:23,090 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 21:00:23,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 21:00:23,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 21:00:23,090 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 21:00:23,096 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:00:23" (1/1) ... [2022-12-11 21:00:23,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:00:23" (1/1) ... [2022-12-11 21:00:23,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:00:23" (1/1) ... [2022-12-11 21:00:23,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:00:23" (1/1) ... [2022-12-11 21:00:23,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:00:23" (1/1) ... [2022-12-11 21:00:23,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:00:23" (1/1) ... [2022-12-11 21:00:23,119 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:00:23" (1/1) ... [2022-12-11 21:00:23,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:00:23" (1/1) ... [2022-12-11 21:00:23,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 21:00:23,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 21:00:23,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 21:00:23,122 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 21:00:23,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:00:23" (1/1) ... [2022-12-11 21:00:23,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 21:00:23,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:00:23,180 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:00:23,196 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:00:23,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 21:00:23,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 21:00:23,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 21:00:23,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 21:00:23,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 21:00:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 21:00:23,223 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 21:00:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 21:00:23,223 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 21:00:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 21:00:23,223 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 21:00:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-11 21:00:23,223 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-11 21:00:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 21:00:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 21:00:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 21:00:23,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 21:00:23,224 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:00:23,326 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 21:00:23,327 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 21:00:23,611 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 21:00:23,733 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 21:00:23,733 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 21:00:23,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 09:00:23 BoogieIcfgContainer [2022-12-11 21:00:23,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 21:00:23,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 21:00:23,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 21:00:23,739 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 21:00:23,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 09:00:22" (1/3) ... [2022-12-11 21:00:23,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c83862d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 09:00:23, skipping insertion in model container [2022-12-11 21:00:23,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:00:23" (2/3) ... [2022-12-11 21:00:23,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c83862d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 09:00:23, skipping insertion in model container [2022-12-11 21:00:23,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 09:00:23" (3/3) ... [2022-12-11 21:00:23,741 INFO L112 eAbstractionObserver]: Analyzing ICFG mix046.opt.i [2022-12-11 21:00:23,763 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 21:00:23,763 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 21:00:23,763 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 21:00:23,835 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 21:00:23,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2022-12-11 21:00:23,934 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-11 21:00:23,934 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 21:00:23,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-11 21:00:23,939 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2022-12-11 21:00:23,942 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2022-12-11 21:00:23,950 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 21:00:23,955 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;@2d160a2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 21:00:23,955 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-11 21:00:23,983 INFO L130 PetriNetUnfolder]: 0/87 cut-off events. [2022-12-11 21:00:23,984 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 21:00:23,984 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:23,985 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:00:23,986 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:23,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:23,995 INFO L85 PathProgramCache]: Analyzing trace with hash -412749091, now seen corresponding path program 1 times [2022-12-11 21:00:24,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:24,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106797022] [2022-12-11 21:00:24,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:24,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:24,544 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:00:24,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:24,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106797022] [2022-12-11 21:00:24,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106797022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:24,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:24,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 21:00:24,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674085188] [2022-12-11 21:00:24,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:24,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 21:00:24,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:24,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 21:00:24,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 21:00:24,591 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 130 [2022-12-11 21:00:24,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 126 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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:00:24,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:24,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 130 [2022-12-11 21:00:24,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:24,693 INFO L130 PetriNetUnfolder]: 17/205 cut-off events. [2022-12-11 21:00:24,694 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-11 21:00:24,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 205 events. 17/205 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 501 event pairs, 3 based on Foata normal form. 9/207 useless extension candidates. Maximal degree in co-relation 206. Up to 27 conditions per place. [2022-12-11 21:00:24,698 INFO L137 encePairwiseOnDemand]: 125/130 looper letters, 11 selfloop transitions, 2 changer transitions 0/125 dead transitions. [2022-12-11 21:00:24,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 125 transitions, 288 flow [2022-12-11 21:00:24,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 21:00:24,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 21:00:24,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2022-12-11 21:00:24,714 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9384615384615385 [2022-12-11 21:00:24,717 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 0 predicate places. [2022-12-11 21:00:24,717 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 125 transitions, 288 flow [2022-12-11 21:00:24,721 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 125 transitions, 288 flow [2022-12-11 21:00:24,722 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 125 transitions, 288 flow [2022-12-11 21:00:24,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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:00:24,723 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:24,723 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] [2022-12-11 21:00:24,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 21:00:24,723 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:24,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:24,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1189405173, now seen corresponding path program 1 times [2022-12-11 21:00:24,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:24,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007150431] [2022-12-11 21:00:24,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:24,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:25,295 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:00:25,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:25,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007150431] [2022-12-11 21:00:25,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007150431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:25,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:25,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:00:25,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618054600] [2022-12-11 21:00:25,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:25,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:00:25,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:25,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:00:25,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:00:25,301 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 130 [2022-12-11 21:00:25,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 125 transitions, 288 flow. Second operand has 7 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:00:25,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:25,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 130 [2022-12-11 21:00:25,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:26,563 INFO L130 PetriNetUnfolder]: 3187/8039 cut-off events. [2022-12-11 21:00:26,563 INFO L131 PetriNetUnfolder]: For 1032/1589 co-relation queries the response was YES. [2022-12-11 21:00:26,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14008 conditions, 8039 events. 3187/8039 cut-off events. For 1032/1589 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 77639 event pairs, 462 based on Foata normal form. 1/7833 useless extension candidates. Maximal degree in co-relation 13939. Up to 2156 conditions per place. [2022-12-11 21:00:26,607 INFO L137 encePairwiseOnDemand]: 114/130 looper letters, 46 selfloop transitions, 16 changer transitions 107/248 dead transitions. [2022-12-11 21:00:26,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 248 transitions, 958 flow [2022-12-11 21:00:26,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:00:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:00:26,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1369 transitions. [2022-12-11 21:00:26,611 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8100591715976332 [2022-12-11 21:00:26,612 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 12 predicate places. [2022-12-11 21:00:26,612 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 248 transitions, 958 flow [2022-12-11 21:00:26,632 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 141 transitions, 484 flow [2022-12-11 21:00:26,632 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 141 transitions, 484 flow [2022-12-11 21:00:26,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:00:26,633 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:26,633 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:00:26,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 21:00:26,633 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:26,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:26,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1610153996, now seen corresponding path program 1 times [2022-12-11 21:00:26,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:26,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798683236] [2022-12-11 21:00:26,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:26,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:26,974 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:00:26,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:26,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798683236] [2022-12-11 21:00:26,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798683236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:26,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:26,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:00:26,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198270589] [2022-12-11 21:00:26,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:26,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:00:26,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:26,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:00:26,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:00:26,977 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 130 [2022-12-11 21:00:26,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 141 transitions, 484 flow. Second operand has 7 states, 7 states have (on average 97.28571428571429) internal successors, (681), 7 states have internal predecessors, (681), 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:00:26,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:26,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 130 [2022-12-11 21:00:26,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:27,790 INFO L130 PetriNetUnfolder]: 1971/4321 cut-off events. [2022-12-11 21:00:27,790 INFO L131 PetriNetUnfolder]: For 1031/5039 co-relation queries the response was YES. [2022-12-11 21:00:27,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11147 conditions, 4321 events. 1971/4321 cut-off events. For 1031/5039 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 34204 event pairs, 166 based on Foata normal form. 121/4363 useless extension candidates. Maximal degree in co-relation 11064. Up to 2334 conditions per place. [2022-12-11 21:00:27,811 INFO L137 encePairwiseOnDemand]: 117/130 looper letters, 64 selfloop transitions, 12 changer transitions 92/247 dead transitions. [2022-12-11 21:00:27,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 247 transitions, 1316 flow [2022-12-11 21:00:27,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:00:27,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:00:27,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1340 transitions. [2022-12-11 21:00:27,814 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7928994082840237 [2022-12-11 21:00:27,815 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 3 predicate places. [2022-12-11 21:00:27,815 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 247 transitions, 1316 flow [2022-12-11 21:00:27,827 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 155 transitions, 700 flow [2022-12-11 21:00:27,827 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 155 transitions, 700 flow [2022-12-11 21:00:27,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.28571428571429) internal successors, (681), 7 states have internal predecessors, (681), 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:00:27,828 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:27,828 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:00:27,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 21:00:27,828 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:27,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:27,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1145095619, now seen corresponding path program 1 times [2022-12-11 21:00:27,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:27,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442489351] [2022-12-11 21:00:27,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:27,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:28,266 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:00:28,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:28,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442489351] [2022-12-11 21:00:28,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442489351] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:28,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:28,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 21:00:28,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000063288] [2022-12-11 21:00:28,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:28,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 21:00:28,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:28,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 21:00:28,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-11 21:00:28,268 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 130 [2022-12-11 21:00:28,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 155 transitions, 700 flow. Second operand has 10 states, 10 states have (on average 105.8) internal successors, (1058), 10 states have internal predecessors, (1058), 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:00:28,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:28,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 130 [2022-12-11 21:00:28,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:28,764 INFO L130 PetriNetUnfolder]: 1379/3390 cut-off events. [2022-12-11 21:00:28,764 INFO L131 PetriNetUnfolder]: For 2644/5348 co-relation queries the response was YES. [2022-12-11 21:00:28,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9543 conditions, 3390 events. 1379/3390 cut-off events. For 2644/5348 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 27123 event pairs, 180 based on Foata normal form. 129/3442 useless extension candidates. Maximal degree in co-relation 9451. Up to 1658 conditions per place. [2022-12-11 21:00:28,785 INFO L137 encePairwiseOnDemand]: 119/130 looper letters, 50 selfloop transitions, 16 changer transitions 43/215 dead transitions. [2022-12-11 21:00:28,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 215 transitions, 1348 flow [2022-12-11 21:00:28,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:00:28,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:00:28,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1404 transitions. [2022-12-11 21:00:28,789 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8307692307692308 [2022-12-11 21:00:28,789 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 6 predicate places. [2022-12-11 21:00:28,789 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 215 transitions, 1348 flow [2022-12-11 21:00:28,802 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 172 transitions, 966 flow [2022-12-11 21:00:28,802 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 172 transitions, 966 flow [2022-12-11 21:00:28,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 105.8) internal successors, (1058), 10 states have internal predecessors, (1058), 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:00:28,803 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:28,803 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:00:28,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 21:00:28,804 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:28,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:28,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1534717841, now seen corresponding path program 1 times [2022-12-11 21:00:28,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:28,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522684689] [2022-12-11 21:00:28,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:28,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:29,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:00:29,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:29,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522684689] [2022-12-11 21:00:29,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522684689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:29,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:29,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 21:00:29,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578748263] [2022-12-11 21:00:29,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:29,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 21:00:29,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:29,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 21:00:29,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-11 21:00:29,494 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 130 [2022-12-11 21:00:29,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 172 transitions, 966 flow. Second operand has 9 states, 9 states have (on average 96.88888888888889) internal successors, (872), 9 states have internal predecessors, (872), 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:00:29,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:29,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 130 [2022-12-11 21:00:29,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:30,474 INFO L130 PetriNetUnfolder]: 1400/3164 cut-off events. [2022-12-11 21:00:30,474 INFO L131 PetriNetUnfolder]: For 3755/20914 co-relation queries the response was YES. [2022-12-11 21:00:30,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11732 conditions, 3164 events. 1400/3164 cut-off events. For 3755/20914 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 23676 event pairs, 82 based on Foata normal form. 193/3295 useless extension candidates. Maximal degree in co-relation 11626. Up to 1726 conditions per place. [2022-12-11 21:00:30,495 INFO L137 encePairwiseOnDemand]: 115/130 looper letters, 91 selfloop transitions, 70 changer transitions 67/307 dead transitions. [2022-12-11 21:00:30,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 307 transitions, 2516 flow [2022-12-11 21:00:30,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 21:00:30,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 21:00:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1638 transitions. [2022-12-11 21:00:30,502 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7875 [2022-12-11 21:00:30,504 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 15 predicate places. [2022-12-11 21:00:30,504 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 307 transitions, 2516 flow [2022-12-11 21:00:30,518 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 240 transitions, 1856 flow [2022-12-11 21:00:30,519 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 240 transitions, 1856 flow [2022-12-11 21:00:30,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 96.88888888888889) internal successors, (872), 9 states have internal predecessors, (872), 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:00:30,519 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:30,519 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:00:30,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 21:00:30,520 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:30,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:30,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1060026385, now seen corresponding path program 2 times [2022-12-11 21:00:30,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:30,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89640080] [2022-12-11 21:00:30,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:30,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:31,100 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:00:31,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:31,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89640080] [2022-12-11 21:00:31,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89640080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:31,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:31,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-11 21:00:31,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054439621] [2022-12-11 21:00:31,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:31,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-11 21:00:31,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:31,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-11 21:00:31,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-11 21:00:31,103 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 130 [2022-12-11 21:00:31,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 240 transitions, 1856 flow. Second operand has 11 states, 11 states have (on average 104.81818181818181) internal successors, (1153), 11 states have internal predecessors, (1153), 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:00:31,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:31,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 130 [2022-12-11 21:00:31,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:31,736 INFO L130 PetriNetUnfolder]: 1433/3349 cut-off events. [2022-12-11 21:00:31,736 INFO L131 PetriNetUnfolder]: For 7253/18268 co-relation queries the response was YES. [2022-12-11 21:00:31,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13353 conditions, 3349 events. 1433/3349 cut-off events. For 7253/18268 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 25753 event pairs, 110 based on Foata normal form. 368/3653 useless extension candidates. Maximal degree in co-relation 13237. Up to 1771 conditions per place. [2022-12-11 21:00:31,759 INFO L137 encePairwiseOnDemand]: 119/130 looper letters, 87 selfloop transitions, 31 changer transitions 37/285 dead transitions. [2022-12-11 21:00:31,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 285 transitions, 2682 flow [2022-12-11 21:00:31,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:00:31,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:00:31,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1391 transitions. [2022-12-11 21:00:31,763 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.823076923076923 [2022-12-11 21:00:31,765 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 18 predicate places. [2022-12-11 21:00:31,765 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 285 transitions, 2682 flow [2022-12-11 21:00:31,782 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 248 transitions, 2188 flow [2022-12-11 21:00:31,783 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 248 transitions, 2188 flow [2022-12-11 21:00:31,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 104.81818181818181) internal successors, (1153), 11 states have internal predecessors, (1153), 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:00:31,788 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:31,789 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:00:31,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 21:00:31,789 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:31,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:31,789 INFO L85 PathProgramCache]: Analyzing trace with hash -2097632431, now seen corresponding path program 3 times [2022-12-11 21:00:31,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:31,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008144847] [2022-12-11 21:00:31,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:31,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:32,219 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:00:32,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:32,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008144847] [2022-12-11 21:00:32,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008144847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:32,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:32,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-11 21:00:32,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625002023] [2022-12-11 21:00:32,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:32,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-11 21:00:32,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:32,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-11 21:00:32,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-11 21:00:32,224 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 130 [2022-12-11 21:00:32,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 248 transitions, 2188 flow. Second operand has 11 states, 11 states have (on average 105.72727272727273) internal successors, (1163), 11 states have internal predecessors, (1163), 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:00:32,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:32,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 130 [2022-12-11 21:00:32,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:32,720 INFO L130 PetriNetUnfolder]: 1314/3215 cut-off events. [2022-12-11 21:00:32,721 INFO L131 PetriNetUnfolder]: For 10479/28404 co-relation queries the response was YES. [2022-12-11 21:00:32,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13660 conditions, 3215 events. 1314/3215 cut-off events. For 10479/28404 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 25465 event pairs, 78 based on Foata normal form. 255/3406 useless extension candidates. Maximal degree in co-relation 13535. Up to 1642 conditions per place. [2022-12-11 21:00:32,742 INFO L137 encePairwiseOnDemand]: 119/130 looper letters, 88 selfloop transitions, 32 changer transitions 38/289 dead transitions. [2022-12-11 21:00:32,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 289 transitions, 3054 flow [2022-12-11 21:00:32,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:00:32,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:00:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1404 transitions. [2022-12-11 21:00:32,745 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8307692307692308 [2022-12-11 21:00:32,746 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 24 predicate places. [2022-12-11 21:00:32,746 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 289 transitions, 3054 flow [2022-12-11 21:00:32,797 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 251 transitions, 2470 flow [2022-12-11 21:00:32,798 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 251 transitions, 2470 flow [2022-12-11 21:00:32,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 105.72727272727273) internal successors, (1163), 11 states have internal predecessors, (1163), 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:00:32,798 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:32,798 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:00:32,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 21:00:32,799 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:32,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:32,799 INFO L85 PathProgramCache]: Analyzing trace with hash 974278508, now seen corresponding path program 1 times [2022-12-11 21:00:32,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:32,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501678499] [2022-12-11 21:00:32,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:32,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:33,534 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:00:33,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:33,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501678499] [2022-12-11 21:00:33,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501678499] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:33,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:33,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-11 21:00:33,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394384157] [2022-12-11 21:00:33,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:33,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-11 21:00:33,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:33,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-11 21:00:33,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-12-11 21:00:33,537 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 130 [2022-12-11 21:00:33,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 251 transitions, 2470 flow. Second operand has 13 states, 13 states have (on average 95.15384615384616) internal successors, (1237), 13 states have internal predecessors, (1237), 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:00:33,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:33,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 130 [2022-12-11 21:00:33,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:34,732 INFO L130 PetriNetUnfolder]: 1159/2825 cut-off events. [2022-12-11 21:00:34,733 INFO L131 PetriNetUnfolder]: For 13564/55849 co-relation queries the response was YES. [2022-12-11 21:00:34,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13906 conditions, 2825 events. 1159/2825 cut-off events. For 13564/55849 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 21609 event pairs, 34 based on Foata normal form. 555/3315 useless extension candidates. Maximal degree in co-relation 13766. Up to 1480 conditions per place. [2022-12-11 21:00:34,753 INFO L137 encePairwiseOnDemand]: 113/130 looper letters, 121 selfloop transitions, 95 changer transitions 43/337 dead transitions. [2022-12-11 21:00:34,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 337 transitions, 3880 flow [2022-12-11 21:00:34,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-11 21:00:34,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-11 21:00:34,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1984 transitions. [2022-12-11 21:00:34,758 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7630769230769231 [2022-12-11 21:00:34,759 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 37 predicate places. [2022-12-11 21:00:34,759 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 337 transitions, 3880 flow [2022-12-11 21:00:34,775 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 294 transitions, 3322 flow [2022-12-11 21:00:34,775 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 294 transitions, 3322 flow [2022-12-11 21:00:34,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 95.15384615384616) internal successors, (1237), 13 states have internal predecessors, (1237), 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:00:34,776 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:34,776 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:00:34,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 21:00:34,776 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:34,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:34,776 INFO L85 PathProgramCache]: Analyzing trace with hash 377534444, now seen corresponding path program 2 times [2022-12-11 21:00:34,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:34,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24071011] [2022-12-11 21:00:34,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:34,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:35,291 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:00:35,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:35,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24071011] [2022-12-11 21:00:35,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24071011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:35,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:35,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-11 21:00:35,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483591960] [2022-12-11 21:00:35,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:35,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-11 21:00:35,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:35,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-11 21:00:35,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-12-11 21:00:35,293 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 130 [2022-12-11 21:00:35,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 294 transitions, 3322 flow. Second operand has 13 states, 13 states have (on average 103.6923076923077) internal successors, (1348), 13 states have internal predecessors, (1348), 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:00:35,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:35,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 130 [2022-12-11 21:00:35,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:35,740 INFO L130 PetriNetUnfolder]: 1207/2949 cut-off events. [2022-12-11 21:00:35,741 INFO L131 PetriNetUnfolder]: For 17609/43869 co-relation queries the response was YES. [2022-12-11 21:00:35,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15489 conditions, 2949 events. 1207/2949 cut-off events. For 17609/43869 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 22900 event pairs, 42 based on Foata normal form. 213/3103 useless extension candidates. Maximal degree in co-relation 15338. Up to 1552 conditions per place. [2022-12-11 21:00:35,764 INFO L137 encePairwiseOnDemand]: 117/130 looper letters, 113 selfloop transitions, 25 changer transitions 19/319 dead transitions. [2022-12-11 21:00:35,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 319 transitions, 4062 flow [2022-12-11 21:00:35,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-11 21:00:35,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-11 21:00:35,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1473 transitions. [2022-12-11 21:00:35,767 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8093406593406594 [2022-12-11 21:00:35,769 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 41 predicate places. [2022-12-11 21:00:35,769 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 319 transitions, 4062 flow [2022-12-11 21:00:35,830 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 300 transitions, 3706 flow [2022-12-11 21:00:35,830 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 300 transitions, 3706 flow [2022-12-11 21:00:35,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 103.6923076923077) internal successors, (1348), 13 states have internal predecessors, (1348), 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:00:35,831 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:35,831 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:00:35,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 21:00:35,831 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:35,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:35,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1489908294, now seen corresponding path program 3 times [2022-12-11 21:00:35,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:35,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863876666] [2022-12-11 21:00:35,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:35,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:36,447 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:00:36,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:36,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863876666] [2022-12-11 21:00:36,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863876666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:36,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:36,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-11 21:00:36,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671836544] [2022-12-11 21:00:36,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:36,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-11 21:00:36,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:36,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-11 21:00:36,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-12-11 21:00:36,450 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 130 [2022-12-11 21:00:36,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 300 transitions, 3706 flow. Second operand has 13 states, 13 states have (on average 104.61538461538461) internal successors, (1360), 13 states have internal predecessors, (1360), 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:00:36,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:36,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 130 [2022-12-11 21:00:36,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:37,139 INFO L130 PetriNetUnfolder]: 1222/3100 cut-off events. [2022-12-11 21:00:37,139 INFO L131 PetriNetUnfolder]: For 25877/44274 co-relation queries the response was YES. [2022-12-11 21:00:37,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16810 conditions, 3100 events. 1222/3100 cut-off events. For 25877/44274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 24945 event pairs, 48 based on Foata normal form. 351/3388 useless extension candidates. Maximal degree in co-relation 16649. Up to 1579 conditions per place. [2022-12-11 21:00:37,164 INFO L137 encePairwiseOnDemand]: 118/130 looper letters, 103 selfloop transitions, 36 changer transitions 19/321 dead transitions. [2022-12-11 21:00:37,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 321 transitions, 4418 flow [2022-12-11 21:00:37,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-11 21:00:37,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-11 21:00:37,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1590 transitions. [2022-12-11 21:00:37,169 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8153846153846154 [2022-12-11 21:00:37,169 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 49 predicate places. [2022-12-11 21:00:37,169 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 321 transitions, 4418 flow [2022-12-11 21:00:37,187 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 302 transitions, 4024 flow [2022-12-11 21:00:37,187 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 302 transitions, 4024 flow [2022-12-11 21:00:37,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 104.61538461538461) internal successors, (1360), 13 states have internal predecessors, (1360), 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:00:37,188 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:37,188 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:00:37,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 21:00:37,189 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:37,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:37,190 INFO L85 PathProgramCache]: Analyzing trace with hash -624646578, now seen corresponding path program 4 times [2022-12-11 21:00:37,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:37,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811065521] [2022-12-11 21:00:37,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:37,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:37,714 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:00:37,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:37,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811065521] [2022-12-11 21:00:37,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811065521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:37,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:37,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-11 21:00:37,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105138738] [2022-12-11 21:00:37,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:37,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 21:00:37,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:37,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 21:00:37,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-11 21:00:37,716 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 130 [2022-12-11 21:00:37,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 302 transitions, 4024 flow. Second operand has 12 states, 12 states have (on average 103.83333333333333) internal successors, (1246), 12 states have internal predecessors, (1246), 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:00:37,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:37,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 130 [2022-12-11 21:00:37,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:38,388 INFO L130 PetriNetUnfolder]: 1157/3046 cut-off events. [2022-12-11 21:00:38,388 INFO L131 PetriNetUnfolder]: For 27646/62361 co-relation queries the response was YES. [2022-12-11 21:00:38,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17297 conditions, 3046 events. 1157/3046 cut-off events. For 27646/62361 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 25405 event pairs, 24 based on Foata normal form. 302/3306 useless extension candidates. Maximal degree in co-relation 17125. Up to 1520 conditions per place. [2022-12-11 21:00:38,410 INFO L137 encePairwiseOnDemand]: 118/130 looper letters, 112 selfloop transitions, 38 changer transitions 19/331 dead transitions. [2022-12-11 21:00:38,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 331 transitions, 4960 flow [2022-12-11 21:00:38,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-11 21:00:38,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-11 21:00:38,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1480 transitions. [2022-12-11 21:00:38,411 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8131868131868132 [2022-12-11 21:00:38,412 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 56 predicate places. [2022-12-11 21:00:38,412 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 331 transitions, 4960 flow [2022-12-11 21:00:38,427 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 312 transitions, 4528 flow [2022-12-11 21:00:38,428 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 312 transitions, 4528 flow [2022-12-11 21:00:38,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 103.83333333333333) internal successors, (1246), 12 states have internal predecessors, (1246), 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:00:38,428 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:38,428 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:00:38,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 21:00:38,429 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:38,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:38,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1489139598, now seen corresponding path program 1 times [2022-12-11 21:00:38,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:38,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786084900] [2022-12-11 21:00:38,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:38,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:38,547 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:00:38,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:38,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786084900] [2022-12-11 21:00:38,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786084900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:38,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:38,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 21:00:38,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680129651] [2022-12-11 21:00:38,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:38,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 21:00:38,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:38,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 21:00:38,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 21:00:38,549 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 130 [2022-12-11 21:00:38,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 312 transitions, 4528 flow. Second operand has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 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:00:38,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:38,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 130 [2022-12-11 21:00:38,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:41,614 INFO L130 PetriNetUnfolder]: 14277/24474 cut-off events. [2022-12-11 21:00:41,614 INFO L131 PetriNetUnfolder]: For 580002/626813 co-relation queries the response was YES. [2022-12-11 21:00:41,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133128 conditions, 24474 events. 14277/24474 cut-off events. For 580002/626813 co-relation queries the response was YES. Maximal size of possible extension queue 1948. Compared 217607 event pairs, 393 based on Foata normal form. 1018/23537 useless extension candidates. Maximal degree in co-relation 132952. Up to 8541 conditions per place. [2022-12-11 21:00:41,832 INFO L137 encePairwiseOnDemand]: 119/130 looper letters, 325 selfloop transitions, 20 changer transitions 52/591 dead transitions. [2022-12-11 21:00:41,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 591 transitions, 11237 flow [2022-12-11 21:00:41,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 21:00:41,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 21:00:41,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1134 transitions. [2022-12-11 21:00:41,834 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8723076923076923 [2022-12-11 21:00:41,835 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 59 predicate places. [2022-12-11 21:00:41,835 INFO L82 GeneralOperation]: Start removeDead. Operand has 196 places, 591 transitions, 11237 flow [2022-12-11 21:00:41,960 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 196 places, 539 transitions, 9885 flow [2022-12-11 21:00:41,961 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 539 transitions, 9885 flow [2022-12-11 21:00:41,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 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:00:41,962 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:41,962 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:00:41,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-11 21:00:41,962 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:41,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:41,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1378149892, now seen corresponding path program 1 times [2022-12-11 21:00:41,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:41,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270227247] [2022-12-11 21:00:41,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:41,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:42,087 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:00:42,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:42,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270227247] [2022-12-11 21:00:42,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270227247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:42,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:42,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:00:42,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748738851] [2022-12-11 21:00:42,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:42,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:00:42,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:42,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:00:42,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:00:42,091 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 130 [2022-12-11 21:00:42,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 539 transitions, 9885 flow. Second operand has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 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:00:42,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:42,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 130 [2022-12-11 21:00:42,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:45,453 INFO L130 PetriNetUnfolder]: 11108/22595 cut-off events. [2022-12-11 21:00:45,454 INFO L131 PetriNetUnfolder]: For 396851/435059 co-relation queries the response was YES. [2022-12-11 21:00:45,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113900 conditions, 22595 events. 11108/22595 cut-off events. For 396851/435059 co-relation queries the response was YES. Maximal size of possible extension queue 1873. Compared 235627 event pairs, 132 based on Foata normal form. 2986/24657 useless extension candidates. Maximal degree in co-relation 113720. Up to 7527 conditions per place. [2022-12-11 21:00:45,633 INFO L137 encePairwiseOnDemand]: 119/130 looper letters, 489 selfloop transitions, 52 changer transitions 174/906 dead transitions. [2022-12-11 21:00:45,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 906 transitions, 19675 flow [2022-12-11 21:00:45,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:00:45,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:00:45,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1477 transitions. [2022-12-11 21:00:45,636 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8739644970414201 [2022-12-11 21:00:45,636 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 71 predicate places. [2022-12-11 21:00:45,636 INFO L82 GeneralOperation]: Start removeDead. Operand has 208 places, 906 transitions, 19675 flow [2022-12-11 21:00:45,719 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 208 places, 732 transitions, 15023 flow [2022-12-11 21:00:45,720 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 732 transitions, 15023 flow [2022-12-11 21:00:45,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 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:00:45,720 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:45,720 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:00:45,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-11 21:00:45,720 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:45,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:45,721 INFO L85 PathProgramCache]: Analyzing trace with hash 336890173, now seen corresponding path program 1 times [2022-12-11 21:00:45,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:45,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170908227] [2022-12-11 21:00:45,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:45,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:46,107 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:00:46,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:46,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170908227] [2022-12-11 21:00:46,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170908227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:46,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:46,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:00:46,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554523937] [2022-12-11 21:00:46,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:46,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:00:46,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:46,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:00:46,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:00:46,109 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 130 [2022-12-11 21:00:46,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 732 transitions, 15023 flow. Second operand has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 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:00:46,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:46,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 130 [2022-12-11 21:00:46,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:49,933 INFO L130 PetriNetUnfolder]: 13368/29079 cut-off events. [2022-12-11 21:00:49,933 INFO L131 PetriNetUnfolder]: For 516991/577309 co-relation queries the response was YES. [2022-12-11 21:00:50,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150870 conditions, 29079 events. 13368/29079 cut-off events. For 516991/577309 co-relation queries the response was YES. Maximal size of possible extension queue 2274. Compared 329674 event pairs, 209 based on Foata normal form. 1571/29621 useless extension candidates. Maximal degree in co-relation 150676. Up to 10508 conditions per place. [2022-12-11 21:00:50,116 INFO L137 encePairwiseOnDemand]: 120/130 looper letters, 424 selfloop transitions, 27 changer transitions 404/1018 dead transitions. [2022-12-11 21:00:50,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 1018 transitions, 23994 flow [2022-12-11 21:00:50,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 21:00:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 21:00:50,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1016 transitions. [2022-12-11 21:00:50,118 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7815384615384615 [2022-12-11 21:00:50,118 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 80 predicate places. [2022-12-11 21:00:50,118 INFO L82 GeneralOperation]: Start removeDead. Operand has 217 places, 1018 transitions, 23994 flow [2022-12-11 21:00:50,181 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 211 places, 614 transitions, 12564 flow [2022-12-11 21:00:50,181 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 614 transitions, 12564 flow [2022-12-11 21:00:50,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 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:00:50,182 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:50,182 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:00:50,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-11 21:00:50,182 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:50,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:50,182 INFO L85 PathProgramCache]: Analyzing trace with hash -191410789, now seen corresponding path program 1 times [2022-12-11 21:00:50,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:50,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664417380] [2022-12-11 21:00:50,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:50,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:50,379 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:00:50,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:50,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664417380] [2022-12-11 21:00:50,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664417380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:50,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:50,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 21:00:50,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185656069] [2022-12-11 21:00:50,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:50,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 21:00:50,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:50,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 21:00:50,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 21:00:50,382 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 130 [2022-12-11 21:00:50,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 614 transitions, 12564 flow. Second operand has 8 states, 8 states have (on average 107.25) internal successors, (858), 8 states have internal predecessors, (858), 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:00:50,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:50,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 130 [2022-12-11 21:00:50,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:53,943 INFO L130 PetriNetUnfolder]: 9208/22417 cut-off events. [2022-12-11 21:00:53,944 INFO L131 PetriNetUnfolder]: For 270101/315144 co-relation queries the response was YES. [2022-12-11 21:00:54,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107317 conditions, 22417 events. 9208/22417 cut-off events. For 270101/315144 co-relation queries the response was YES. Maximal size of possible extension queue 2012. Compared 271368 event pairs, 90 based on Foata normal form. 3861/25475 useless extension candidates. Maximal degree in co-relation 107119. Up to 7278 conditions per place. [2022-12-11 21:00:54,078 INFO L137 encePairwiseOnDemand]: 119/130 looper letters, 317 selfloop transitions, 96 changer transitions 175/765 dead transitions. [2022-12-11 21:00:54,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 765 transitions, 16766 flow [2022-12-11 21:00:54,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 21:00:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 21:00:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1819 transitions. [2022-12-11 21:00:54,080 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8745192307692308 [2022-12-11 21:00:54,087 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 89 predicate places. [2022-12-11 21:00:54,087 INFO L82 GeneralOperation]: Start removeDead. Operand has 226 places, 765 transitions, 16766 flow [2022-12-11 21:00:54,139 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 226 places, 590 transitions, 12055 flow [2022-12-11 21:00:54,139 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 590 transitions, 12055 flow [2022-12-11 21:00:54,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.25) internal successors, (858), 8 states have internal predecessors, (858), 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:00:54,139 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:54,140 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:00:54,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-11 21:00:54,140 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:54,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:54,141 INFO L85 PathProgramCache]: Analyzing trace with hash 569626993, now seen corresponding path program 1 times [2022-12-11 21:00:54,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:54,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582727640] [2022-12-11 21:00:54,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:54,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:54,531 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:00:54,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:54,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582727640] [2022-12-11 21:00:54,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582727640] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:54,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:54,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 21:00:54,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851945007] [2022-12-11 21:00:54,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:54,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 21:00:54,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:54,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 21:00:54,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-11 21:00:54,533 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 130 [2022-12-11 21:00:54,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 590 transitions, 12055 flow. Second operand has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 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:00:54,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:54,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 130 [2022-12-11 21:00:54,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:57,931 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([361] L756-->L761: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][440], [278#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 170#true, 18#L822true, 299#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 251#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 105#L857true, P0Thread1of1ForFork1InUse, 147#true, 421#true, 22#L793true, 378#(and (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff0_thd3~0 0) (or (= ~z$w_buff1~0 0) (not (= ~z$w_buff1~0 ~z~0))) (<= 0 ~z$r_buff1_thd0~0) (or (= ~z~0 1) (= ~z$w_buff1~0 ~z~0)) (= ~z$r_buff0_thd0~0 0)), 193#true, 457#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 344#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 217#(= ~z$r_buff0_thd0~0 0), 460#true, 500#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 404#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0)), 509#(= ~b~0 1), 93#L761true, 144#true, 89#L776true]) [2022-12-11 21:00:57,931 INFO L382 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-12-11 21:00:57,931 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 21:00:57,931 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 21:00:57,931 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 21:00:57,942 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([361] L756-->L761: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][440], [278#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 408#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 2) (or (= ~z~0 1) (= ~z$w_buff1~0 ~z~0)) (= ~z$r_buff0_thd0~0 0)), 18#L822true, 170#true, 299#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 251#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 105#L857true, P0Thread1of1ForFork1InUse, 365#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 147#true, 421#true, 22#L793true, 193#true, 457#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 217#(= ~z$r_buff0_thd0~0 0), 460#true, 500#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 509#(= ~b~0 1), 93#L761true, 340#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 144#true, 89#L776true]) [2022-12-11 21:00:57,942 INFO L382 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-12-11 21:00:57,942 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 21:00:57,942 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 21:00:57,942 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 21:00:58,328 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([361] L756-->L761: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][440], [278#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 170#true, 18#L822true, 299#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 251#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 147#true, 421#true, 22#L793true, 378#(and (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff0_thd3~0 0) (or (= ~z$w_buff1~0 0) (not (= ~z$w_buff1~0 ~z~0))) (<= 0 ~z$r_buff1_thd0~0) (or (= ~z~0 1) (= ~z$w_buff1~0 ~z~0)) (= ~z$r_buff0_thd0~0 0)), 193#true, 457#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 80#L2true, 344#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 217#(= ~z$r_buff0_thd0~0 0), 460#true, 500#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 404#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0)), 509#(= ~b~0 1), 93#L761true, 144#true, 89#L776true]) [2022-12-11 21:00:58,329 INFO L382 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-12-11 21:00:58,329 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 21:00:58,329 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 21:00:58,329 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 21:00:58,331 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([361] L756-->L761: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][782], [278#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 170#true, 18#L822true, 299#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 251#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 105#L857true, P0Thread1of1ForFork1InUse, 147#true, 421#true, 504#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 378#(and (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff0_thd3~0 0) (or (= ~z$w_buff1~0 0) (not (= ~z$w_buff1~0 ~z~0))) (<= 0 ~z$r_buff1_thd0~0) (or (= ~z~0 1) (= ~z$w_buff1~0 ~z~0)) (= ~z$r_buff0_thd0~0 0)), 193#true, 457#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 344#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 217#(= ~z$r_buff0_thd0~0 0), 460#true, 115#L796true, 404#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0)), 509#(= ~b~0 1), 93#L761true, 144#true, 89#L776true]) [2022-12-11 21:00:58,331 INFO L382 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-12-11 21:00:58,331 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 21:00:58,331 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 21:00:58,331 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 21:00:58,340 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([361] L756-->L761: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][440], [278#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 408#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 2) (or (= ~z~0 1) (= ~z$w_buff1~0 ~z~0)) (= ~z$r_buff0_thd0~0 0)), 18#L822true, 170#true, 299#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 251#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 365#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 147#true, 421#true, 22#L793true, 193#true, 457#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 80#L2true, 217#(= ~z$r_buff0_thd0~0 0), 460#true, 500#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 509#(= ~b~0 1), 93#L761true, 340#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 144#true, 89#L776true]) [2022-12-11 21:00:58,340 INFO L382 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-12-11 21:00:58,340 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 21:00:58,340 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 21:00:58,340 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 21:00:58,341 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([361] L756-->L761: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][782], [278#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 408#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 2) (or (= ~z~0 1) (= ~z$w_buff1~0 ~z~0)) (= ~z$r_buff0_thd0~0 0)), 18#L822true, 170#true, 299#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 251#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 105#L857true, P0Thread1of1ForFork1InUse, 365#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 147#true, 421#true, 504#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 193#true, 457#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 217#(= ~z$r_buff0_thd0~0 0), 460#true, 115#L796true, 509#(= ~b~0 1), 93#L761true, 340#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 144#true, 89#L776true]) [2022-12-11 21:00:58,341 INFO L382 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-12-11 21:00:58,341 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 21:00:58,341 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 21:00:58,341 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 21:00:58,825 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([361] L756-->L761: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][605], [278#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 170#true, 18#L822true, 299#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 251#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork0InUse, 66#L3true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 459#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork1InUse, 147#true, 421#true, 22#L793true, 502#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 378#(and (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff0_thd3~0 0) (or (= ~z$w_buff1~0 0) (not (= ~z$w_buff1~0 ~z~0))) (<= 0 ~z$r_buff1_thd0~0) (or (= ~z~0 1) (= ~z$w_buff1~0 ~z~0)) (= ~z$r_buff0_thd0~0 0)), 193#true, 344#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 217#(= ~z$r_buff0_thd0~0 0), 460#true, 404#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0)), 509#(= ~b~0 1), 93#L761true, 144#true, 89#L776true]) [2022-12-11 21:00:58,825 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-12-11 21:00:58,825 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 21:00:58,825 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 21:00:58,825 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 21:00:58,827 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([361] L756-->L761: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][782], [278#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 170#true, 18#L822true, 299#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 251#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 147#true, 421#true, 504#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 378#(and (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff0_thd3~0 0) (or (= ~z$w_buff1~0 0) (not (= ~z$w_buff1~0 ~z~0))) (<= 0 ~z$r_buff1_thd0~0) (or (= ~z~0 1) (= ~z$w_buff1~0 ~z~0)) (= ~z$r_buff0_thd0~0 0)), 193#true, 457#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 80#L2true, 344#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 217#(= ~z$r_buff0_thd0~0 0), 460#true, 115#L796true, 404#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0)), 509#(= ~b~0 1), 93#L761true, 144#true, 89#L776true]) [2022-12-11 21:00:58,827 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-12-11 21:00:58,827 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 21:00:58,827 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 21:00:58,827 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 21:00:58,835 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([361] L756-->L761: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][605], [278#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 408#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 2) (or (= ~z~0 1) (= ~z$w_buff1~0 ~z~0)) (= ~z$r_buff0_thd0~0 0)), 18#L822true, 170#true, 299#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 251#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork0InUse, 66#L3true, P1Thread1of1ForFork3InUse, 459#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 365#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 147#true, 421#true, 22#L793true, 502#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 193#true, 217#(= ~z$r_buff0_thd0~0 0), 460#true, 509#(= ~b~0 1), 93#L761true, 340#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 144#true, 89#L776true]) [2022-12-11 21:00:58,836 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-12-11 21:00:58,836 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 21:00:58,836 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 21:00:58,836 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 21:00:58,836 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([361] L756-->L761: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][782], [278#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 408#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 2) (or (= ~z~0 1) (= ~z$w_buff1~0 ~z~0)) (= ~z$r_buff0_thd0~0 0)), 18#L822true, 170#true, 299#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 251#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 365#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 147#true, 421#true, 504#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 193#true, 457#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 80#L2true, 217#(= ~z$r_buff0_thd0~0 0), 460#true, 115#L796true, 509#(= ~b~0 1), 93#L761true, 340#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 144#true, 89#L776true]) [2022-12-11 21:00:58,836 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-12-11 21:00:58,837 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 21:00:58,837 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 21:00:58,837 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 21:00:59,094 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([361] L756-->L761: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][680], [278#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 170#true, 18#L822true, 299#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 251#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork0InUse, 131#L3-1true, P1Thread1of1ForFork3InUse, 426#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P3Thread1of1ForFork2InUse, 459#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork1InUse, 147#true, 22#L793true, 502#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 378#(and (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff0_thd3~0 0) (or (= ~z$w_buff1~0 0) (not (= ~z$w_buff1~0 ~z~0))) (<= 0 ~z$r_buff1_thd0~0) (or (= ~z~0 1) (= ~z$w_buff1~0 ~z~0)) (= ~z$r_buff0_thd0~0 0)), 193#true, 344#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 217#(= ~z$r_buff0_thd0~0 0), 460#true, 404#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0)), 509#(= ~b~0 1), 93#L761true, 144#true, 89#L776true]) [2022-12-11 21:00:59,094 INFO L382 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-12-11 21:00:59,094 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 21:00:59,094 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 21:00:59,094 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 21:00:59,095 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([361] L756-->L761: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][858], [278#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 170#true, 18#L822true, 299#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 251#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork0InUse, 66#L3true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 459#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork1InUse, 147#true, 421#true, 378#(and (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff0_thd3~0 0) (or (= ~z$w_buff1~0 0) (not (= ~z$w_buff1~0 ~z~0))) (<= 0 ~z$r_buff1_thd0~0) (or (= ~z~0 1) (= ~z$w_buff1~0 ~z~0)) (= ~z$r_buff0_thd0~0 0)), 193#true, 344#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 217#(= ~z$r_buff0_thd0~0 0), 460#true, 115#L796true, 506#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 404#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0)), 509#(= ~b~0 1), 93#L761true, 144#true, 89#L776true]) [2022-12-11 21:00:59,095 INFO L382 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-12-11 21:00:59,095 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 21:00:59,095 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 21:00:59,096 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 21:00:59,103 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([361] L756-->L761: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][680], [278#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 408#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 2) (or (= ~z~0 1) (= ~z$w_buff1~0 ~z~0)) (= ~z$r_buff0_thd0~0 0)), 18#L822true, 170#true, 299#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 251#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork0InUse, 131#L3-1true, P1Thread1of1ForFork3InUse, 426#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P3Thread1of1ForFork2InUse, 459#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork1InUse, 365#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 147#true, 22#L793true, 502#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 193#true, 217#(= ~z$r_buff0_thd0~0 0), 460#true, 509#(= ~b~0 1), 93#L761true, 340#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 144#true, 89#L776true]) [2022-12-11 21:00:59,103 INFO L382 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-12-11 21:00:59,103 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 21:00:59,103 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 21:00:59,103 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 21:00:59,103 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([361] L756-->L761: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][858], [278#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 408#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 2) (or (= ~z~0 1) (= ~z$w_buff1~0 ~z~0)) (= ~z$r_buff0_thd0~0 0)), 18#L822true, 170#true, 299#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 251#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork0InUse, 66#L3true, P1Thread1of1ForFork3InUse, 459#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 365#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 147#true, 421#true, 193#true, 217#(= ~z$r_buff0_thd0~0 0), 460#true, 115#L796true, 506#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 509#(= ~b~0 1), 93#L761true, 340#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 144#true, 89#L776true]) [2022-12-11 21:00:59,103 INFO L382 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-12-11 21:00:59,103 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 21:00:59,104 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 21:00:59,104 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 21:00:59,295 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([361] L756-->L761: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][891], [278#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 170#true, 18#L822true, 299#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 251#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork0InUse, 131#L3-1true, P1Thread1of1ForFork3InUse, 426#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P3Thread1of1ForFork2InUse, 459#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork1InUse, 147#true, 378#(and (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff0_thd3~0 0) (or (= ~z$w_buff1~0 0) (not (= ~z$w_buff1~0 ~z~0))) (<= 0 ~z$r_buff1_thd0~0) (or (= ~z~0 1) (= ~z$w_buff1~0 ~z~0)) (= ~z$r_buff0_thd0~0 0)), 193#true, 344#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 217#(= ~z$r_buff0_thd0~0 0), 460#true, 115#L796true, 506#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 404#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0)), 509#(= ~b~0 1), 93#L761true, 144#true, 89#L776true]) [2022-12-11 21:00:59,295 INFO L382 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-12-11 21:00:59,295 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 21:00:59,295 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 21:00:59,295 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 21:00:59,299 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([361] L756-->L761: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][891], [278#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), 408#(and (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 2) (or (= ~z~0 1) (= ~z$w_buff1~0 ~z~0)) (= ~z$r_buff0_thd0~0 0)), 18#L822true, 170#true, 299#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 251#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P2Thread1of1ForFork0InUse, 131#L3-1true, P1Thread1of1ForFork3InUse, 426#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P3Thread1of1ForFork2InUse, 459#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork1InUse, 365#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 147#true, 193#true, 217#(= ~z$r_buff0_thd0~0 0), 460#true, 115#L796true, 506#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 509#(= ~b~0 1), 93#L761true, 340#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 144#true, 89#L776true]) [2022-12-11 21:00:59,299 INFO L382 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-12-11 21:00:59,299 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 21:00:59,299 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 21:00:59,299 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 21:00:59,823 INFO L130 PetriNetUnfolder]: 16402/40890 cut-off events. [2022-12-11 21:00:59,823 INFO L131 PetriNetUnfolder]: For 411390/473879 co-relation queries the response was YES. [2022-12-11 21:00:59,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189888 conditions, 40890 events. 16402/40890 cut-off events. For 411390/473879 co-relation queries the response was YES. Maximal size of possible extension queue 4116. Compared 551145 event pairs, 132 based on Foata normal form. 1678/40672 useless extension candidates. Maximal degree in co-relation 189675. Up to 12863 conditions per place. [2022-12-11 21:01:00,024 INFO L137 encePairwiseOnDemand]: 112/130 looper letters, 282 selfloop transitions, 63 changer transitions 468/1005 dead transitions. [2022-12-11 21:01:00,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 1005 transitions, 25355 flow [2022-12-11 21:01:00,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 21:01:00,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 21:01:00,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 928 transitions. [2022-12-11 21:01:00,026 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7931623931623931 [2022-12-11 21:01:00,026 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 97 predicate places. [2022-12-11 21:01:00,026 INFO L82 GeneralOperation]: Start removeDead. Operand has 234 places, 1005 transitions, 25355 flow [2022-12-11 21:01:00,074 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 229 places, 537 transitions, 10915 flow [2022-12-11 21:01:00,074 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 537 transitions, 10915 flow [2022-12-11 21:01:00,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 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:01:00,075 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:01:00,075 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:01:00,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-11 21:01:00,075 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:01:00,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:01:00,075 INFO L85 PathProgramCache]: Analyzing trace with hash -2048630445, now seen corresponding path program 2 times [2022-12-11 21:01:00,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:01:00,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800860] [2022-12-11 21:01:00,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:01:00,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:01:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:01:00,230 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:01:00,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:01:00,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800860] [2022-12-11 21:01:00,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:01:00,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:01:00,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 21:01:00,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120461397] [2022-12-11 21:01:00,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:01:00,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 21:01:00,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:01:00,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 21:01:00,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-11 21:01:00,232 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 130 [2022-12-11 21:01:00,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 537 transitions, 10915 flow. Second operand has 9 states, 9 states have (on average 107.11111111111111) internal successors, (964), 9 states have internal predecessors, (964), 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:01:00,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:01:00,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 130 [2022-12-11 21:01:00,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:01:03,406 INFO L130 PetriNetUnfolder]: 7234/19734 cut-off events. [2022-12-11 21:01:03,406 INFO L131 PetriNetUnfolder]: For 127715/157929 co-relation queries the response was YES. [2022-12-11 21:01:03,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93035 conditions, 19734 events. 7234/19734 cut-off events. For 127715/157929 co-relation queries the response was YES. Maximal size of possible extension queue 2155. Compared 254309 event pairs, 65 based on Foata normal form. 4559/23532 useless extension candidates. Maximal degree in co-relation 92818. Up to 5969 conditions per place. [2022-12-11 21:01:03,481 INFO L137 encePairwiseOnDemand]: 119/130 looper letters, 112 selfloop transitions, 47 changer transitions 267/548 dead transitions. [2022-12-11 21:01:03,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 548 transitions, 11623 flow [2022-12-11 21:01:03,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-11 21:01:03,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-11 21:01:03,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2113 transitions. [2022-12-11 21:01:03,483 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8554655870445345 [2022-12-11 21:01:03,489 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 110 predicate places. [2022-12-11 21:01:03,489 INFO L82 GeneralOperation]: Start removeDead. Operand has 247 places, 548 transitions, 11623 flow [2022-12-11 21:01:03,509 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 241 places, 281 transitions, 5251 flow [2022-12-11 21:01:03,510 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 281 transitions, 5251 flow [2022-12-11 21:01:03,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 107.11111111111111) internal successors, (964), 9 states have internal predecessors, (964), 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:01:03,510 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:01:03,510 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:01:03,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-11 21:01:03,511 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:01:03,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:01:03,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1378711665, now seen corresponding path program 1 times [2022-12-11 21:01:03,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:01:03,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887349011] [2022-12-11 21:01:03,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:01:03,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:01:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:01:03,704 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:01:03,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:01:03,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887349011] [2022-12-11 21:01:03,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887349011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:01:03,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:01:03,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:01:03,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705687450] [2022-12-11 21:01:03,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:01:03,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:01:03,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:01:03,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:01:03,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:01:03,706 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 130 [2022-12-11 21:01:03,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 281 transitions, 5251 flow. Second operand has 7 states, 7 states have (on average 109.57142857142857) internal successors, (767), 7 states have internal predecessors, (767), 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:01:03,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:01:03,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 130 [2022-12-11 21:01:03,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:01:04,178 INFO L130 PetriNetUnfolder]: 1125/4448 cut-off events. [2022-12-11 21:01:04,178 INFO L131 PetriNetUnfolder]: For 48613/51292 co-relation queries the response was YES. [2022-12-11 21:01:04,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22412 conditions, 4448 events. 1125/4448 cut-off events. For 48613/51292 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 49147 event pairs, 16 based on Foata normal form. 49/4433 useless extension candidates. Maximal degree in co-relation 22190. Up to 1262 conditions per place. [2022-12-11 21:01:04,195 INFO L137 encePairwiseOnDemand]: 124/130 looper letters, 29 selfloop transitions, 1 changer transitions 185/318 dead transitions. [2022-12-11 21:01:04,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 318 transitions, 6837 flow [2022-12-11 21:01:04,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 21:01:04,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 21:01:04,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 779 transitions. [2022-12-11 21:01:04,197 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.856043956043956 [2022-12-11 21:01:04,198 INFO L295 CegarLoopForPetriNet]: 137 programPoint places, 110 predicate places. [2022-12-11 21:01:04,198 INFO L82 GeneralOperation]: Start removeDead. Operand has 247 places, 318 transitions, 6837 flow [2022-12-11 21:01:04,203 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 133 transitions, 1664 flow [2022-12-11 21:01:04,203 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 133 transitions, 1664 flow [2022-12-11 21:01:04,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.57142857142857) internal successors, (767), 7 states have internal predecessors, (767), 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:01:04,204 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:01:04,204 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:01:04,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-11 21:01:04,204 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:01:04,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:01:04,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1509661945, now seen corresponding path program 2 times [2022-12-11 21:01:04,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:01:04,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496373146] [2022-12-11 21:01:04,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:01:04,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:01:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 21:01:04,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 21:01:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 21:01:04,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 21:01:04,324 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 21:01:04,326 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-11 21:01:04,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-11 21:01:04,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-11 21:01:04,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-11 21:01:04,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-11 21:01:04,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-11 21:01:04,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-11 21:01:04,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-11 21:01:04,333 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:01:04,338 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 21:01:04,338 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 21:01:04,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 09:01:04 BasicIcfg [2022-12-11 21:01:04,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 21:01:04,440 INFO L158 Benchmark]: Toolchain (without parser) took 41902.83ms. Allocated memory was 181.4MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 156.6MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-12-11 21:01:04,440 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory was 158.9MB in the beginning and 158.9MB in the end (delta: 63.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 21:01:04,441 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.66ms. Allocated memory is still 181.4MB. Free memory was 156.2MB in the beginning and 128.7MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-11 21:01:04,441 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.25ms. Allocated memory is still 181.4MB. Free memory was 128.7MB in the beginning and 125.8MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-11 21:01:04,441 INFO L158 Benchmark]: Boogie Preprocessor took 31.44ms. Allocated memory is still 181.4MB. Free memory was 125.8MB in the beginning and 124.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 21:01:04,441 INFO L158 Benchmark]: RCFGBuilder took 612.89ms. Allocated memory is still 181.4MB. Free memory was 123.7MB in the beginning and 90.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-11 21:01:04,441 INFO L158 Benchmark]: TraceAbstraction took 40702.91ms. Allocated memory was 181.4MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 89.1MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-12-11 21:01:04,442 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 181.4MB. Free memory was 158.9MB in the beginning and 158.9MB in the end (delta: 63.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 483.66ms. Allocated memory is still 181.4MB. Free memory was 156.2MB in the beginning and 128.7MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.25ms. Allocated memory is still 181.4MB. Free memory was 128.7MB in the beginning and 125.8MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.44ms. Allocated memory is still 181.4MB. Free memory was 125.8MB in the beginning and 124.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 612.89ms. Allocated memory is still 181.4MB. Free memory was 123.7MB in the beginning and 90.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 40702.91ms. Allocated memory was 181.4MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 89.1MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [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] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L720] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L721] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L722] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L724] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L726] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L728] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L729] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L730] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L731] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L732] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L733] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L734] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L735] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L736] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L737] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L738] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L739] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L740] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L741] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L742] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L743] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L744] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L745] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L746] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L747] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L748] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1221; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1221, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1221, ((void *)0), P0, ((void *)0))=-3, t1221={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1222; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1222, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1222, ((void *)0), P1, ((void *)0))=-2, t1221={5:0}, t1222={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1223; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t1223, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1223, ((void *)0), P2, ((void *)0))=-1, t1221={5:0}, t1222={6:0}, t1223={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1224; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] FCALL, FORK 0 pthread_create(&t1224, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1224, ((void *)0), P3, ((void *)0))=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 849]: 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: 853]: 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: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.6s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 40.5s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 31.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1348 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1348 mSDsluCounter, 1952 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1588 mSDsCounter, 175 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2777 IncrementalHoareTripleChecker+Invalid, 2952 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 175 mSolverCounterUnsat, 364 mSDtfsCounter, 2777 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 297 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15023occurred in iteration=13, InterpolantAutomatonStates: 231, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 53080 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 1699 NumberOfCodeBlocks, 1699 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1580 ConstructedInterpolants, 0 QuantifiedInterpolants, 8788 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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:01:04,461 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...