/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix033.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 19:02:56,669 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 19:02:56,671 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 19:02:56,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 19:02:56,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 19:02:56,710 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 19:02:56,713 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 19:02:56,717 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 19:02:56,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 19:02:56,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 19:02:56,725 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 19:02:56,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 19:02:56,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 19:02:56,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 19:02:56,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 19:02:56,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 19:02:56,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 19:02:56,736 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 19:02:56,738 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 19:02:56,742 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 19:02:56,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 19:02:56,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 19:02:56,745 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 19:02:56,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 19:02:56,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 19:02:56,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 19:02:56,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 19:02:56,754 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 19:02:56,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 19:02:56,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 19:02:56,755 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 19:02:56,757 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 19:02:56,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 19:02:56,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 19:02:56,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 19:02:56,760 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 19:02:56,760 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 19:02:56,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 19:02:56,761 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 19:02:56,761 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 19:02:56,762 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 19:02:56,763 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 19:02:56,789 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 19:02:56,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 19:02:56,790 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 19:02:56,790 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 19:02:56,791 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 19:02:56,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 19:02:56,792 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 19:02:56,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 19:02:56,792 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 19:02:56,792 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 19:02:56,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 19:02:56,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 19:02:56,793 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 19:02:56,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 19:02:56,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 19:02:56,794 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 19:02:56,794 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 19:02:56,794 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 19:02:56,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 19:02:56,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 19:02:56,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 19:02:56,794 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 19:02:56,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 19:02:56,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 19:02:56,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 19:02:56,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 19:02:56,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 19:02:56,795 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 19:02:56,795 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 19:02:56,795 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 19:02:56,795 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 19:02:56,796 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-11 19:02:57,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 19:02:57,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 19:02:57,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 19:02:57,126 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 19:02:57,127 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 19:02:57,128 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033.opt.i [2022-12-11 19:02:58,264 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 19:02:58,506 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 19:02:58,507 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033.opt.i [2022-12-11 19:02:58,520 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b1f1c4e8/177813aea940413c84f30832098c7e0d/FLAG7239696aa [2022-12-11 19:02:58,532 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b1f1c4e8/177813aea940413c84f30832098c7e0d [2022-12-11 19:02:58,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 19:02:58,535 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 19:02:58,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 19:02:58,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 19:02:58,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 19:02:58,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 07:02:58" (1/1) ... [2022-12-11 19:02:58,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61ab9e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:02:58, skipping insertion in model container [2022-12-11 19:02:58,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 07:02:58" (1/1) ... [2022-12-11 19:02:58,545 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 19:02:58,603 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 19:02:58,724 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/mix033.opt.i[944,957] [2022-12-11 19:02:58,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 19:02:58,935 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 19:02:58,945 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/mix033.opt.i[944,957] [2022-12-11 19:02:58,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:58,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:58,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:59,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:59,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:59,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:59,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:59,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:59,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:59,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:59,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:59,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:59,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:59,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:59,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:02:59,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:02:59,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 19:02:59,053 INFO L208 MainTranslator]: Completed translation [2022-12-11 19:02:59,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:02:59 WrapperNode [2022-12-11 19:02:59,054 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 19:02:59,056 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 19:02:59,056 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 19:02:59,056 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 19:02:59,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:02:59" (1/1) ... [2022-12-11 19:02:59,093 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:02:59" (1/1) ... [2022-12-11 19:02:59,127 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2022-12-11 19:02:59,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 19:02:59,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 19:02:59,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 19:02:59,129 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 19:02:59,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:02:59" (1/1) ... [2022-12-11 19:02:59,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:02:59" (1/1) ... [2022-12-11 19:02:59,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:02:59" (1/1) ... [2022-12-11 19:02:59,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:02:59" (1/1) ... [2022-12-11 19:02:59,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:02:59" (1/1) ... [2022-12-11 19:02:59,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:02:59" (1/1) ... [2022-12-11 19:02:59,165 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:02:59" (1/1) ... [2022-12-11 19:02:59,166 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:02:59" (1/1) ... [2022-12-11 19:02:59,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 19:02:59,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 19:02:59,169 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 19:02:59,169 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 19:02:59,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:02:59" (1/1) ... [2022-12-11 19:02:59,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 19:02:59,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:02:59,208 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 19:02:59,231 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 19:02:59,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 19:02:59,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 19:02:59,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 19:02:59,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 19:02:59,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 19:02:59,251 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 19:02:59,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 19:02:59,251 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 19:02:59,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 19:02:59,251 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 19:02:59,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 19:02:59,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 19:02:59,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 19:02:59,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 19:02:59,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 19:02:59,254 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 19:02:59,420 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 19:02:59,435 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 19:02:59,658 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 19:02:59,769 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 19:02:59,770 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 19:02:59,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 07:02:59 BoogieIcfgContainer [2022-12-11 19:02:59,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 19:02:59,774 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 19:02:59,774 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 19:02:59,776 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 19:02:59,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 07:02:58" (1/3) ... [2022-12-11 19:02:59,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@219e3bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 07:02:59, skipping insertion in model container [2022-12-11 19:02:59,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:02:59" (2/3) ... [2022-12-11 19:02:59,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@219e3bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 07:02:59, skipping insertion in model container [2022-12-11 19:02:59,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 07:02:59" (3/3) ... [2022-12-11 19:02:59,779 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033.opt.i [2022-12-11 19:02:59,794 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 19:02:59,794 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 19:02:59,794 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 19:02:59,857 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 19:02:59,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-12-11 19:02:59,940 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-12-11 19:02:59,941 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 19:02:59,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-11 19:02:59,946 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-12-11 19:02:59,950 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-12-11 19:02:59,961 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 19:02:59,968 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;@107bf3ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 19:02:59,968 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-11 19:02:59,987 INFO L130 PetriNetUnfolder]: 0/75 cut-off events. [2022-12-11 19:02:59,988 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 19:02:59,988 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:02:59,989 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] [2022-12-11 19:02:59,991 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:02:59,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:03:00,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1972684076, now seen corresponding path program 1 times [2022-12-11 19:03:00,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:03:00,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878221167] [2022-12-11 19:03:00,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:03:00,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:03:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:03:00,620 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 19:03:00,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:03:00,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878221167] [2022-12-11 19:03:00,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878221167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:03:00,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:03:00,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 19:03:00,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750056780] [2022-12-11 19:03:00,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:03:00,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 19:03:00,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:03:00,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 19:03:00,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 19:03:00,675 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 114 [2022-12-11 19:03:00,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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 19:03:00,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:03:00,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 114 [2022-12-11 19:03:00,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:03:00,784 INFO L130 PetriNetUnfolder]: 10/149 cut-off events. [2022-12-11 19:03:00,785 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-11 19:03:00,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 149 events. 10/149 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 289 event pairs, 2 based on Foata normal form. 8/151 useless extension candidates. Maximal degree in co-relation 135. Up to 17 conditions per place. [2022-12-11 19:03:00,788 INFO L137 encePairwiseOnDemand]: 109/114 looper letters, 8 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2022-12-11 19:03:00,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 109 transitions, 247 flow [2022-12-11 19:03:00,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 19:03:00,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 19:03:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-12-11 19:03:00,804 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9385964912280702 [2022-12-11 19:03:00,805 INFO L175 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 321 transitions. [2022-12-11 19:03:00,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 109 transitions, 247 flow [2022-12-11 19:03:00,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 109 transitions, 244 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-11 19:03:00,813 INFO L231 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2022-12-11 19:03:00,815 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2022-12-11 19:03:00,819 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2022-12-11 19:03:00,819 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2022-12-11 19:03:00,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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 19:03:00,820 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:03:00,821 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] [2022-12-11 19:03:00,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 19:03:00,821 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:03:00,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:03:00,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1810059170, now seen corresponding path program 1 times [2022-12-11 19:03:00,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:03:00,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573706572] [2022-12-11 19:03:00,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:03:00,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:03:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:03:01,301 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 19:03:01,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:03:01,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573706572] [2022-12-11 19:03:01,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573706572] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:03:01,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:03:01,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 19:03:01,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723633530] [2022-12-11 19:03:01,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:03:01,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 19:03:01,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:03:01,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 19:03:01,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 19:03:01,306 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 114 [2022-12-11 19:03:01,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 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 19:03:01,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:03:01,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 114 [2022-12-11 19:03:01,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:03:01,555 INFO L130 PetriNetUnfolder]: 84/389 cut-off events. [2022-12-11 19:03:01,555 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-11 19:03:01,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 389 events. 84/389 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1914 event pairs, 18 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 531. Up to 65 conditions per place. [2022-12-11 19:03:01,558 INFO L137 encePairwiseOnDemand]: 108/114 looper letters, 15 selfloop transitions, 2 changer transitions 34/133 dead transitions. [2022-12-11 19:03:01,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 133 transitions, 366 flow [2022-12-11 19:03:01,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 19:03:01,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 19:03:01,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions. [2022-12-11 19:03:01,561 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8674463937621832 [2022-12-11 19:03:01,561 INFO L175 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 9 states and 890 transitions. [2022-12-11 19:03:01,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 133 transitions, 366 flow [2022-12-11 19:03:01,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 133 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-11 19:03:01,564 INFO L231 Difference]: Finished difference. Result has 129 places, 97 transitions, 220 flow [2022-12-11 19:03:01,565 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=220, PETRI_PLACES=129, PETRI_TRANSITIONS=97} [2022-12-11 19:03:01,565 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2022-12-11 19:03:01,566 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 97 transitions, 220 flow [2022-12-11 19:03:01,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 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 19:03:01,566 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:03:01,566 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:03:01,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 19:03:01,567 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:03:01,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:03:01,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1892820283, now seen corresponding path program 1 times [2022-12-11 19:03:01,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:03:01,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619206171] [2022-12-11 19:03:01,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:03:01,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:03:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:03:01,849 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 19:03:01,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:03:01,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619206171] [2022-12-11 19:03:01,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619206171] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:03:01,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:03:01,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:03:01,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417091941] [2022-12-11 19:03:01,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:03:01,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:03:01,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:03:01,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:03:01,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:03:01,855 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2022-12-11 19:03:01,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 97 transitions, 220 flow. Second operand has 7 states, 7 states have (on average 88.42857142857143) internal successors, (619), 7 states have internal predecessors, (619), 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 19:03:01,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:03:01,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2022-12-11 19:03:01,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:03:02,330 INFO L130 PetriNetUnfolder]: 482/1221 cut-off events. [2022-12-11 19:03:02,330 INFO L131 PetriNetUnfolder]: For 289/289 co-relation queries the response was YES. [2022-12-11 19:03:02,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2366 conditions, 1221 events. 482/1221 cut-off events. For 289/289 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7563 event pairs, 164 based on Foata normal form. 30/1200 useless extension candidates. Maximal degree in co-relation 2302. Up to 275 conditions per place. [2022-12-11 19:03:02,340 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 35 selfloop transitions, 6 changer transitions 47/162 dead transitions. [2022-12-11 19:03:02,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 162 transitions, 576 flow [2022-12-11 19:03:02,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 19:03:02,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 19:03:02,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1209 transitions. [2022-12-11 19:03:02,343 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8157894736842105 [2022-12-11 19:03:02,344 INFO L175 Difference]: Start difference. First operand has 129 places, 97 transitions, 220 flow. Second operand 13 states and 1209 transitions. [2022-12-11 19:03:02,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 162 transitions, 576 flow [2022-12-11 19:03:02,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 162 transitions, 520 flow, removed 24 selfloop flow, removed 8 redundant places. [2022-12-11 19:03:02,350 INFO L231 Difference]: Finished difference. Result has 129 places, 101 transitions, 285 flow [2022-12-11 19:03:02,351 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=285, PETRI_PLACES=129, PETRI_TRANSITIONS=101} [2022-12-11 19:03:02,351 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2022-12-11 19:03:02,352 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 101 transitions, 285 flow [2022-12-11 19:03:02,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.42857142857143) internal successors, (619), 7 states have internal predecessors, (619), 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 19:03:02,352 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:03:02,352 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 19:03:02,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 19:03:02,353 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:03:02,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:03:02,353 INFO L85 PathProgramCache]: Analyzing trace with hash -219166413, now seen corresponding path program 1 times [2022-12-11 19:03:02,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:03:02,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118906540] [2022-12-11 19:03:02,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:03:02,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:03:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:03:02,556 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 19:03:02,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:03:02,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118906540] [2022-12-11 19:03:02,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118906540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:03:02,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:03:02,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 19:03:02,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57134470] [2022-12-11 19:03:02,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:03:02,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 19:03:02,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:03:02,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 19:03:02,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 19:03:02,559 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-12-11 19:03:02,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 101 transitions, 285 flow. Second operand has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 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 19:03:02,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:03:02,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-12-11 19:03:02,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:03:03,062 INFO L130 PetriNetUnfolder]: 1378/2716 cut-off events. [2022-12-11 19:03:03,063 INFO L131 PetriNetUnfolder]: For 3278/3562 co-relation queries the response was YES. [2022-12-11 19:03:03,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6727 conditions, 2716 events. 1378/2716 cut-off events. For 3278/3562 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 19823 event pairs, 79 based on Foata normal form. 12/2491 useless extension candidates. Maximal degree in co-relation 6661. Up to 807 conditions per place. [2022-12-11 19:03:03,080 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 34 selfloop transitions, 7 changer transitions 38/161 dead transitions. [2022-12-11 19:03:03,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 161 transitions, 651 flow [2022-12-11 19:03:03,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 19:03:03,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 19:03:03,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 993 transitions. [2022-12-11 19:03:03,083 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8710526315789474 [2022-12-11 19:03:03,083 INFO L175 Difference]: Start difference. First operand has 129 places, 101 transitions, 285 flow. Second operand 10 states and 993 transitions. [2022-12-11 19:03:03,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 161 transitions, 651 flow [2022-12-11 19:03:03,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 161 transitions, 637 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-11 19:03:03,089 INFO L231 Difference]: Finished difference. Result has 131 places, 105 transitions, 333 flow [2022-12-11 19:03:03,089 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=333, PETRI_PLACES=131, PETRI_TRANSITIONS=105} [2022-12-11 19:03:03,090 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 12 predicate places. [2022-12-11 19:03:03,090 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 105 transitions, 333 flow [2022-12-11 19:03:03,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 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 19:03:03,091 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:03:03,091 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:03:03,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 19:03:03,091 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:03:03,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:03:03,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1527846976, now seen corresponding path program 1 times [2022-12-11 19:03:03,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:03:03,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677334300] [2022-12-11 19:03:03,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:03:03,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:03:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:03:03,321 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 19:03:03,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:03:03,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677334300] [2022-12-11 19:03:03,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677334300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:03:03,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:03:03,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:03:03,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077234160] [2022-12-11 19:03:03,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:03:03,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:03:03,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:03:03,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:03:03,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:03:03,325 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-12-11 19:03:03,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 105 transitions, 333 flow. Second operand has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 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 19:03:03,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:03:03,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-12-11 19:03:03,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:03:03,721 INFO L130 PetriNetUnfolder]: 649/1636 cut-off events. [2022-12-11 19:03:03,721 INFO L131 PetriNetUnfolder]: For 3168/3334 co-relation queries the response was YES. [2022-12-11 19:03:03,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5265 conditions, 1636 events. 649/1636 cut-off events. For 3168/3334 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12129 event pairs, 52 based on Foata normal form. 71/1644 useless extension candidates. Maximal degree in co-relation 5194. Up to 445 conditions per place. [2022-12-11 19:03:03,733 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 44 selfloop transitions, 18 changer transitions 26/170 dead transitions. [2022-12-11 19:03:03,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 170 transitions, 890 flow [2022-12-11 19:03:03,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 19:03:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 19:03:03,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1093 transitions. [2022-12-11 19:03:03,736 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8716108452950558 [2022-12-11 19:03:03,736 INFO L175 Difference]: Start difference. First operand has 131 places, 105 transitions, 333 flow. Second operand 11 states and 1093 transitions. [2022-12-11 19:03:03,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 170 transitions, 890 flow [2022-12-11 19:03:03,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 170 transitions, 868 flow, removed 7 selfloop flow, removed 7 redundant places. [2022-12-11 19:03:03,745 INFO L231 Difference]: Finished difference. Result has 136 places, 120 transitions, 504 flow [2022-12-11 19:03:03,746 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=504, PETRI_PLACES=136, PETRI_TRANSITIONS=120} [2022-12-11 19:03:03,748 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 17 predicate places. [2022-12-11 19:03:03,748 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 120 transitions, 504 flow [2022-12-11 19:03:03,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 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 19:03:03,749 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:03:03,749 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] [2022-12-11 19:03:03,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 19:03:03,750 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:03:03,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:03:03,752 INFO L85 PathProgramCache]: Analyzing trace with hash -92228074, now seen corresponding path program 1 times [2022-12-11 19:03:03,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:03:03,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227741512] [2022-12-11 19:03:03,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:03:03,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:03:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:03:04,023 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 19:03:04,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:03:04,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227741512] [2022-12-11 19:03:04,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227741512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:03:04,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:03:04,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 19:03:04,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945935258] [2022-12-11 19:03:04,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:03:04,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 19:03:04,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:03:04,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 19:03:04,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 19:03:04,026 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-12-11 19:03:04,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 120 transitions, 504 flow. Second operand has 8 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 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 19:03:04,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:03:04,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-12-11 19:03:04,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:03:04,398 INFO L130 PetriNetUnfolder]: 571/1447 cut-off events. [2022-12-11 19:03:04,398 INFO L131 PetriNetUnfolder]: For 4632/4854 co-relation queries the response was YES. [2022-12-11 19:03:04,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5520 conditions, 1447 events. 571/1447 cut-off events. For 4632/4854 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 10870 event pairs, 31 based on Foata normal form. 43/1425 useless extension candidates. Maximal degree in co-relation 5447. Up to 393 conditions per place. [2022-12-11 19:03:04,410 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 39 selfloop transitions, 22 changer transitions 24/167 dead transitions. [2022-12-11 19:03:04,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 167 transitions, 954 flow [2022-12-11 19:03:04,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-11 19:03:04,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-11 19:03:04,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1360 transitions. [2022-12-11 19:03:04,414 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8521303258145363 [2022-12-11 19:03:04,414 INFO L175 Difference]: Start difference. First operand has 136 places, 120 transitions, 504 flow. Second operand 14 states and 1360 transitions. [2022-12-11 19:03:04,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 167 transitions, 954 flow [2022-12-11 19:03:04,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 167 transitions, 881 flow, removed 31 selfloop flow, removed 4 redundant places. [2022-12-11 19:03:04,482 INFO L231 Difference]: Finished difference. Result has 152 places, 121 transitions, 519 flow [2022-12-11 19:03:04,482 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=519, PETRI_PLACES=152, PETRI_TRANSITIONS=121} [2022-12-11 19:03:04,483 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 33 predicate places. [2022-12-11 19:03:04,483 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 121 transitions, 519 flow [2022-12-11 19:03:04,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 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 19:03:04,484 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:03:04,484 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 19:03:04,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 19:03:04,484 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:03:04,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:03:04,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1635597220, now seen corresponding path program 1 times [2022-12-11 19:03:04,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:03:04,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375707984] [2022-12-11 19:03:04,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:03:04,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:03:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:03:04,706 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 19:03:04,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:03:04,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375707984] [2022-12-11 19:03:04,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375707984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:03:04,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:03:04,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:03:04,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903063395] [2022-12-11 19:03:04,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:03:04,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:03:04,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:03:04,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:03:04,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:03:04,709 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2022-12-11 19:03:04,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 121 transitions, 519 flow. Second operand has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 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 19:03:04,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:03:04,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2022-12-11 19:03:04,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:03:04,930 INFO L130 PetriNetUnfolder]: 203/1128 cut-off events. [2022-12-11 19:03:04,930 INFO L131 PetriNetUnfolder]: For 2731/2927 co-relation queries the response was YES. [2022-12-11 19:03:04,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3462 conditions, 1128 events. 203/1128 cut-off events. For 2731/2927 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 9903 event pairs, 24 based on Foata normal form. 1/1063 useless extension candidates. Maximal degree in co-relation 3390. Up to 165 conditions per place. [2022-12-11 19:03:04,939 INFO L137 encePairwiseOnDemand]: 102/114 looper letters, 24 selfloop transitions, 9 changer transitions 15/140 dead transitions. [2022-12-11 19:03:04,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 140 transitions, 681 flow [2022-12-11 19:03:04,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 19:03:04,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 19:03:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 645 transitions. [2022-12-11 19:03:04,941 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8082706766917294 [2022-12-11 19:03:04,941 INFO L175 Difference]: Start difference. First operand has 152 places, 121 transitions, 519 flow. Second operand 7 states and 645 transitions. [2022-12-11 19:03:04,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 140 transitions, 681 flow [2022-12-11 19:03:04,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 140 transitions, 579 flow, removed 33 selfloop flow, removed 16 redundant places. [2022-12-11 19:03:04,986 INFO L231 Difference]: Finished difference. Result has 144 places, 117 transitions, 438 flow [2022-12-11 19:03:04,986 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=438, PETRI_PLACES=144, PETRI_TRANSITIONS=117} [2022-12-11 19:03:04,986 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 25 predicate places. [2022-12-11 19:03:04,987 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 117 transitions, 438 flow [2022-12-11 19:03:04,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 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 19:03:04,987 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:03:04,987 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 19:03:04,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 19:03:04,988 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:03:04,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:03:04,988 INFO L85 PathProgramCache]: Analyzing trace with hash -491299324, now seen corresponding path program 2 times [2022-12-11 19:03:04,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:03:04,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639182601] [2022-12-11 19:03:04,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:03:04,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:03:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:03:05,455 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 19:03:05,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:03:05,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639182601] [2022-12-11 19:03:05,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639182601] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:03:05,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:03:05,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 19:03:05,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078824231] [2022-12-11 19:03:05,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:03:05,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 19:03:05,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:03:05,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 19:03:05,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-11 19:03:05,457 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 114 [2022-12-11 19:03:05,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 117 transitions, 438 flow. Second operand has 9 states, 9 states have (on average 85.0) internal successors, (765), 9 states have internal predecessors, (765), 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 19:03:05,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:03:05,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 114 [2022-12-11 19:03:05,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:03:05,739 INFO L130 PetriNetUnfolder]: 104/661 cut-off events. [2022-12-11 19:03:05,739 INFO L131 PetriNetUnfolder]: For 608/686 co-relation queries the response was YES. [2022-12-11 19:03:05,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1661 conditions, 661 events. 104/661 cut-off events. For 608/686 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4687 event pairs, 0 based on Foata normal form. 1/617 useless extension candidates. Maximal degree in co-relation 1638. Up to 80 conditions per place. [2022-12-11 19:03:05,744 INFO L137 encePairwiseOnDemand]: 96/114 looper letters, 31 selfloop transitions, 27 changer transitions 6/152 dead transitions. [2022-12-11 19:03:05,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 152 transitions, 710 flow [2022-12-11 19:03:05,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 19:03:05,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 19:03:05,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 964 transitions. [2022-12-11 19:03:05,746 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7687400318979266 [2022-12-11 19:03:05,747 INFO L175 Difference]: Start difference. First operand has 144 places, 117 transitions, 438 flow. Second operand 11 states and 964 transitions. [2022-12-11 19:03:05,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 152 transitions, 710 flow [2022-12-11 19:03:05,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 152 transitions, 651 flow, removed 18 selfloop flow, removed 7 redundant places. [2022-12-11 19:03:05,754 INFO L231 Difference]: Finished difference. Result has 150 places, 136 transitions, 593 flow [2022-12-11 19:03:05,754 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=593, PETRI_PLACES=150, PETRI_TRANSITIONS=136} [2022-12-11 19:03:05,756 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 31 predicate places. [2022-12-11 19:03:05,756 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 136 transitions, 593 flow [2022-12-11 19:03:05,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 85.0) internal successors, (765), 9 states have internal predecessors, (765), 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 19:03:05,757 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:03:05,757 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 19:03:05,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 19:03:05,758 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:03:05,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:03:05,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1811038112, now seen corresponding path program 3 times [2022-12-11 19:03:05,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:03:05,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540239591] [2022-12-11 19:03:05,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:03:05,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:03:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:03:05,973 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 19:03:05,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:03:05,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540239591] [2022-12-11 19:03:05,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540239591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:03:05,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:03:05,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:03:05,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739773381] [2022-12-11 19:03:05,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:03:05,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:03:05,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:03:05,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:03:05,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:03:05,976 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-12-11 19:03:05,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 136 transitions, 593 flow. Second operand has 7 states, 7 states have (on average 94.42857142857143) internal successors, (661), 7 states have internal predecessors, (661), 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 19:03:05,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:03:05,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-12-11 19:03:05,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:03:06,163 INFO L130 PetriNetUnfolder]: 120/818 cut-off events. [2022-12-11 19:03:06,163 INFO L131 PetriNetUnfolder]: For 882/987 co-relation queries the response was YES. [2022-12-11 19:03:06,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2100 conditions, 818 events. 120/818 cut-off events. For 882/987 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6551 event pairs, 2 based on Foata normal form. 1/762 useless extension candidates. Maximal degree in co-relation 2075. Up to 110 conditions per place. [2022-12-11 19:03:06,169 INFO L137 encePairwiseOnDemand]: 108/114 looper letters, 17 selfloop transitions, 1 changer transitions 32/148 dead transitions. [2022-12-11 19:03:06,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 148 transitions, 731 flow [2022-12-11 19:03:06,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 19:03:06,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 19:03:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 674 transitions. [2022-12-11 19:03:06,172 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8446115288220551 [2022-12-11 19:03:06,172 INFO L175 Difference]: Start difference. First operand has 150 places, 136 transitions, 593 flow. Second operand 7 states and 674 transitions. [2022-12-11 19:03:06,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 148 transitions, 731 flow [2022-12-11 19:03:06,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 148 transitions, 721 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-11 19:03:06,182 INFO L231 Difference]: Finished difference. Result has 155 places, 115 transitions, 452 flow [2022-12-11 19:03:06,182 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=452, PETRI_PLACES=155, PETRI_TRANSITIONS=115} [2022-12-11 19:03:06,183 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 36 predicate places. [2022-12-11 19:03:06,183 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 115 transitions, 452 flow [2022-12-11 19:03:06,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.42857142857143) internal successors, (661), 7 states have internal predecessors, (661), 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 19:03:06,184 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:03:06,184 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 19:03:06,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 19:03:06,184 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:03:06,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:03:06,185 INFO L85 PathProgramCache]: Analyzing trace with hash 85430498, now seen corresponding path program 4 times [2022-12-11 19:03:06,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:03:06,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344252641] [2022-12-11 19:03:06,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:03:06,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:03:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:03:06,785 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 19:03:06,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:03:06,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344252641] [2022-12-11 19:03:06,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344252641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:03:06,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:03:06,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 19:03:06,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089620989] [2022-12-11 19:03:06,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:03:06,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 19:03:06,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:03:06,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 19:03:06,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-11 19:03:06,792 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 114 [2022-12-11 19:03:06,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 115 transitions, 452 flow. Second operand has 9 states, 9 states have (on average 83.22222222222223) internal successors, (749), 9 states have internal predecessors, (749), 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 19:03:06,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:03:06,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 114 [2022-12-11 19:03:06,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:03:07,021 INFO L130 PetriNetUnfolder]: 56/462 cut-off events. [2022-12-11 19:03:07,022 INFO L131 PetriNetUnfolder]: For 459/474 co-relation queries the response was YES. [2022-12-11 19:03:07,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 462 events. 56/462 cut-off events. For 459/474 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3080 event pairs, 0 based on Foata normal form. 1/442 useless extension candidates. Maximal degree in co-relation 1130. Up to 66 conditions per place. [2022-12-11 19:03:07,025 INFO L137 encePairwiseOnDemand]: 97/114 looper letters, 17 selfloop transitions, 12 changer transitions 23/125 dead transitions. [2022-12-11 19:03:07,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 125 transitions, 582 flow [2022-12-11 19:03:07,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-11 19:03:07,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-11 19:03:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1000 transitions. [2022-12-11 19:03:07,028 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7309941520467836 [2022-12-11 19:03:07,028 INFO L175 Difference]: Start difference. First operand has 155 places, 115 transitions, 452 flow. Second operand 12 states and 1000 transitions. [2022-12-11 19:03:07,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 125 transitions, 582 flow [2022-12-11 19:03:07,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 125 transitions, 493 flow, removed 20 selfloop flow, removed 16 redundant places. [2022-12-11 19:03:07,034 INFO L231 Difference]: Finished difference. Result has 149 places, 102 transitions, 335 flow [2022-12-11 19:03:07,034 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=335, PETRI_PLACES=149, PETRI_TRANSITIONS=102} [2022-12-11 19:03:07,035 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 30 predicate places. [2022-12-11 19:03:07,035 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 102 transitions, 335 flow [2022-12-11 19:03:07,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 83.22222222222223) internal successors, (749), 9 states have internal predecessors, (749), 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 19:03:07,036 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:03:07,036 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 19:03:07,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 19:03:07,036 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 19:03:07,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:03:07,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1721085822, now seen corresponding path program 5 times [2022-12-11 19:03:07,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:03:07,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288866336] [2022-12-11 19:03:07,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:03:07,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:03:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 19:03:07,073 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 19:03:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 19:03:07,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 19:03:07,139 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 19:03:07,140 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-11 19:03:07,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-11 19:03:07,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-11 19:03:07,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-11 19:03:07,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-11 19:03:07,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-11 19:03:07,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 19:03:07,143 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2022-12-11 19:03:07,147 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 19:03:07,148 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 19:03:07,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 07:03:07 BasicIcfg [2022-12-11 19:03:07,246 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 19:03:07,246 INFO L158 Benchmark]: Toolchain (without parser) took 8711.65ms. Allocated memory was 202.4MB in the beginning and 320.9MB in the end (delta: 118.5MB). Free memory was 160.0MB in the beginning and 182.7MB in the end (delta: -22.7MB). Peak memory consumption was 96.9MB. Max. memory is 8.0GB. [2022-12-11 19:03:07,247 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 202.4MB. Free memory is still 178.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 19:03:07,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.88ms. Allocated memory is still 202.4MB. Free memory was 160.0MB in the beginning and 133.3MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-11 19:03:07,247 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.01ms. Allocated memory is still 202.4MB. Free memory was 133.3MB in the beginning and 131.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 19:03:07,247 INFO L158 Benchmark]: Boogie Preprocessor took 40.48ms. Allocated memory is still 202.4MB. Free memory was 131.2MB in the beginning and 129.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 19:03:07,248 INFO L158 Benchmark]: RCFGBuilder took 602.54ms. Allocated memory is still 202.4MB. Free memory was 129.1MB in the beginning and 99.7MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-11 19:03:07,248 INFO L158 Benchmark]: TraceAbstraction took 7472.10ms. Allocated memory was 202.4MB in the beginning and 320.9MB in the end (delta: 118.5MB). Free memory was 98.7MB in the beginning and 182.7MB in the end (delta: -84.0MB). Peak memory consumption was 36.0MB. Max. memory is 8.0GB. [2022-12-11 19:03:07,249 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.14ms. Allocated memory is still 202.4MB. Free memory is still 178.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 518.88ms. Allocated memory is still 202.4MB. Free memory was 160.0MB in the beginning and 133.3MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.01ms. Allocated memory is still 202.4MB. Free memory was 133.3MB in the beginning and 131.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.48ms. Allocated memory is still 202.4MB. Free memory was 131.2MB in the beginning and 129.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 602.54ms. Allocated memory is still 202.4MB. Free memory was 129.1MB in the beginning and 99.7MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 7472.10ms. Allocated memory was 202.4MB in the beginning and 320.9MB in the end (delta: 118.5MB). Free memory was 98.7MB in the beginning and 182.7MB in the end (delta: -84.0MB). Peak memory consumption was 36.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L717] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L719] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L721] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0] [L722] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0] [L723] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L725] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L727] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L729] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L730] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L731] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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] [L732] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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] [L733] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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] [L734] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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] [L735] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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] [L736] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0] [L737] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0] [L738] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L740] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L741] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L742] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L743] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L744] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L745] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L747] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 pthread_t t876; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t876={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] FCALL, FORK 0 pthread_create(&t876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t876, ((void *)0), P0, ((void *)0))=-2, t876={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 pthread_t t877; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t876={5:0}, t877={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] FCALL, FORK 0 pthread_create(&t877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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(&t877, ((void *)0), P1, ((void *)0))=-1, t876={5:0}, t877={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t878; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t876={5:0}, t877={6:0}, t878={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] FCALL, FORK 0 pthread_create(&t878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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(&t878, ((void *)0), P2, ((void *)0))=0, t876={5:0}, t877={6:0}, t878={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 3 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=2, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=2, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=2, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 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) [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] 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 [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=49, weak$$choice2=0, x=2, y=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=49, weak$$choice2=0, x=2, y=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t876={5:0}, t877={6:0}, t878={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=49, weak$$choice2=0, x=2, y=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 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) [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] 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 [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t876={5:0}, t877={6:0}, t878={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t876={5:0}, t877={6:0}, t878={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 848]: 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: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 143 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 479 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 479 mSDsluCounter, 590 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 462 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 952 IncrementalHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 128 mSDtfsCounter, 952 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=593occurred in iteration=8, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 910 NumberOfCodeBlocks, 910 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 810 ConstructedInterpolants, 0 QuantifiedInterpolants, 2964 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 19:03:07,269 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...