/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe018_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 14:41:16,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 14:41:16,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 14:41:16,664 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 14:41:16,664 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 14:41:16,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 14:41:16,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 14:41:16,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 14:41:16,668 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 14:41:16,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 14:41:16,669 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 14:41:16,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 14:41:16,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 14:41:16,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 14:41:16,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 14:41:16,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 14:41:16,673 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 14:41:16,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 14:41:16,675 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 14:41:16,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 14:41:16,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 14:41:16,678 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 14:41:16,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 14:41:16,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 14:41:16,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 14:41:16,682 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 14:41:16,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 14:41:16,683 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 14:41:16,684 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 14:41:16,684 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 14:41:16,684 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 14:41:16,685 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 14:41:16,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 14:41:16,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 14:41:16,686 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 14:41:16,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 14:41:16,687 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 14:41:16,687 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 14:41:16,687 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 14:41:16,688 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 14:41:16,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 14:41:16,689 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 14:41:16,705 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 14:41:16,705 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 14:41:16,706 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 14:41:16,706 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 14:41:16,706 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 14:41:16,706 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 14:41:16,706 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 14:41:16,707 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 14:41:16,707 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 14:41:16,707 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 14:41:16,707 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 14:41:16,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 14:41:16,707 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 14:41:16,707 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 14:41:16,707 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 14:41:16,707 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 14:41:16,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 14:41:16,708 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 14:41:16,708 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 14:41:16,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 14:41:16,708 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 14:41:16,708 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 14:41:16,708 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 14:41:16,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:41:16,708 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 14:41:16,708 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 14:41:16,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 14:41:16,709 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 14:41:16,709 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 14:41:16,709 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 14:41:16,709 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-12 14:41:16,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 14:41:16,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 14:41:16,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 14:41:16,994 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 14:41:16,994 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 14:41:16,997 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe018_power.opt.i [2022-12-12 14:41:18,256 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 14:41:18,515 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 14:41:18,515 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_power.opt.i [2022-12-12 14:41:18,529 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c125709c3/c60435468526494ea94ed1b150a36732/FLAGb2a9bd512 [2022-12-12 14:41:18,538 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c125709c3/c60435468526494ea94ed1b150a36732 [2022-12-12 14:41:18,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 14:41:18,541 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 14:41:18,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 14:41:18,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 14:41:18,543 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 14:41:18,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:41:18" (1/1) ... [2022-12-12 14:41:18,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cbbae95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:18, skipping insertion in model container [2022-12-12 14:41:18,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:41:18" (1/1) ... [2022-12-12 14:41:18,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 14:41:18,589 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 14:41:18,731 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/safe018_power.opt.i[994,1007] [2022-12-12 14:41:18,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:41:18,940 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 14:41:18,949 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/safe018_power.opt.i[994,1007] [2022-12-12 14:41:18,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:41:18,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:41:18,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:41:19,023 INFO L208 MainTranslator]: Completed translation [2022-12-12 14:41:19,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:19 WrapperNode [2022-12-12 14:41:19,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 14:41:19,025 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 14:41:19,025 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 14:41:19,025 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 14:41:19,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:19" (1/1) ... [2022-12-12 14:41:19,044 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:19" (1/1) ... [2022-12-12 14:41:19,061 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 177 [2022-12-12 14:41:19,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 14:41:19,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 14:41:19,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 14:41:19,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 14:41:19,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:19" (1/1) ... [2022-12-12 14:41:19,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:19" (1/1) ... [2022-12-12 14:41:19,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:19" (1/1) ... [2022-12-12 14:41:19,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:19" (1/1) ... [2022-12-12 14:41:19,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:19" (1/1) ... [2022-12-12 14:41:19,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:19" (1/1) ... [2022-12-12 14:41:19,101 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:19" (1/1) ... [2022-12-12 14:41:19,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:19" (1/1) ... [2022-12-12 14:41:19,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 14:41:19,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 14:41:19,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 14:41:19,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 14:41:19,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:19" (1/1) ... [2022-12-12 14:41:19,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:41:19,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 14:41:19,134 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-12 14:41:19,157 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-12 14:41:19,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 14:41:19,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 14:41:19,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 14:41:19,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 14:41:19,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 14:41:19,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 14:41:19,174 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 14:41:19,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 14:41:19,174 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 14:41:19,175 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 14:41:19,175 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 14:41:19,175 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 14:41:19,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 14:41:19,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 14:41:19,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 14:41:19,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 14:41:19,178 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 14:41:19,281 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 14:41:19,283 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 14:41:19,643 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 14:41:19,867 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 14:41:19,868 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 14:41:19,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:41:19 BoogieIcfgContainer [2022-12-12 14:41:19,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 14:41:19,872 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 14:41:19,873 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 14:41:19,875 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 14:41:19,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 02:41:18" (1/3) ... [2022-12-12 14:41:19,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7326337a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:41:19, skipping insertion in model container [2022-12-12 14:41:19,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:41:19" (2/3) ... [2022-12-12 14:41:19,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7326337a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:41:19, skipping insertion in model container [2022-12-12 14:41:19,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:41:19" (3/3) ... [2022-12-12 14:41:19,879 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_power.opt.i [2022-12-12 14:41:19,892 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 14:41:19,892 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 14:41:19,893 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 14:41:19,957 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 14:41:19,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-12-12 14:41:20,039 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-12 14:41:20,040 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:41:20,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-12 14:41:20,046 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2022-12-12 14:41:20,051 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 122 transitions, 253 flow [2022-12-12 14:41:20,052 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 14:41:20,068 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 122 transitions, 253 flow [2022-12-12 14:41:20,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 253 flow [2022-12-12 14:41:20,092 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-12 14:41:20,092 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:41:20,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-12 14:41:20,095 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 122 transitions, 253 flow [2022-12-12 14:41:20,095 INFO L226 LiptonReduction]: Number of co-enabled transitions 1692 [2022-12-12 14:41:30,254 INFO L241 LiptonReduction]: Total number of compositions: 105 [2022-12-12 14:41:30,265 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 14:41:30,276 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;@475afff8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 14:41:30,277 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 14:41:30,287 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-12 14:41:30,287 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:41:30,288 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:41:30,289 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-12 14:41:30,289 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:41:30,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:41:30,296 INFO L85 PathProgramCache]: Analyzing trace with hash 831958457, now seen corresponding path program 1 times [2022-12-12 14:41:30,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:41:30,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229198722] [2022-12-12 14:41:30,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:41:30,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:41:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:41:30,658 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-12 14:41:30,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:41:30,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229198722] [2022-12-12 14:41:30,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229198722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:41:30,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:41:30,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:41:30,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853995765] [2022-12-12 14:41:30,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:41:30,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:41:30,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:41:30,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:41:30,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:41:30,689 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 58 [2022-12-12 14:41:30,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-12 14:41:30,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:41:30,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 58 [2022-12-12 14:41:30,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:41:32,309 INFO L130 PetriNetUnfolder]: 7924/12043 cut-off events. [2022-12-12 14:41:32,310 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-12 14:41:32,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23445 conditions, 12043 events. 7924/12043 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 834. Compared 83124 event pairs, 1048 based on Foata normal form. 0/7141 useless extension candidates. Maximal degree in co-relation 23434. Up to 9597 conditions per place. [2022-12-12 14:41:32,346 INFO L137 encePairwiseOnDemand]: 54/58 looper letters, 32 selfloop transitions, 2 changer transitions 52/95 dead transitions. [2022-12-12 14:41:32,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 95 transitions, 374 flow [2022-12-12 14:41:32,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:41:32,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:41:32,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2022-12-12 14:41:32,356 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-12 14:41:32,357 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 125 flow. Second operand 3 states and 116 transitions. [2022-12-12 14:41:32,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 95 transitions, 374 flow [2022-12-12 14:41:32,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 95 transitions, 370 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-12 14:41:32,362 INFO L231 Difference]: Finished difference. Result has 65 places, 30 transitions, 70 flow [2022-12-12 14:41:32,363 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=65, PETRI_TRANSITIONS=30} [2022-12-12 14:41:32,368 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -3 predicate places. [2022-12-12 14:41:32,368 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 30 transitions, 70 flow [2022-12-12 14:41:32,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-12 14:41:32,368 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:41:32,368 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:41:32,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 14:41:32,369 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:41:32,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:41:32,370 INFO L85 PathProgramCache]: Analyzing trace with hash 235197243, now seen corresponding path program 1 times [2022-12-12 14:41:32,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:41:32,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879301029] [2022-12-12 14:41:32,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:41:32,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:41:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:41:32,597 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-12 14:41:32,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:41:32,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879301029] [2022-12-12 14:41:32,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879301029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:41:32,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:41:32,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:41:32,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942430084] [2022-12-12 14:41:32,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:41:32,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:41:32,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:41:32,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:41:32,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:41:32,600 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 58 [2022-12-12 14:41:32,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 30 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:41:32,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:41:32,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 58 [2022-12-12 14:41:32,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:41:32,862 INFO L130 PetriNetUnfolder]: 1099/1753 cut-off events. [2022-12-12 14:41:32,862 INFO L131 PetriNetUnfolder]: For 104/104 co-relation queries the response was YES. [2022-12-12 14:41:32,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3559 conditions, 1753 events. 1099/1753 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8673 event pairs, 374 based on Foata normal form. 25/1461 useless extension candidates. Maximal degree in co-relation 3549. Up to 1444 conditions per place. [2022-12-12 14:41:32,870 INFO L137 encePairwiseOnDemand]: 55/58 looper letters, 33 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2022-12-12 14:41:32,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 174 flow [2022-12-12 14:41:32,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:41:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:41:32,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-12 14:41:32,872 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3620689655172414 [2022-12-12 14:41:32,872 INFO L175 Difference]: Start difference. First operand has 65 places, 30 transitions, 70 flow. Second operand 3 states and 63 transitions. [2022-12-12 14:41:32,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 174 flow [2022-12-12 14:41:32,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:41:32,873 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 74 flow [2022-12-12 14:41:32,873 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2022-12-12 14:41:32,873 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -28 predicate places. [2022-12-12 14:41:32,874 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 74 flow [2022-12-12 14:41:32,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:41:32,874 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:41:32,874 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:41:32,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 14:41:32,874 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:41:32,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:41:32,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1298819577, now seen corresponding path program 1 times [2022-12-12 14:41:32,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:41:32,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583301042] [2022-12-12 14:41:32,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:41:32,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:41:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:41:32,979 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-12 14:41:32,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:41:32,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583301042] [2022-12-12 14:41:32,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583301042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:41:32,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:41:32,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:41:32,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075531824] [2022-12-12 14:41:32,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:41:32,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:41:32,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:41:32,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:41:32,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:41:32,980 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 58 [2022-12-12 14:41:32,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:41:32,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:41:32,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 58 [2022-12-12 14:41:32,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:41:33,321 INFO L130 PetriNetUnfolder]: 1690/2699 cut-off events. [2022-12-12 14:41:33,322 INFO L131 PetriNetUnfolder]: For 241/241 co-relation queries the response was YES. [2022-12-12 14:41:33,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5571 conditions, 2699 events. 1690/2699 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 13781 event pairs, 414 based on Foata normal form. 120/2318 useless extension candidates. Maximal degree in co-relation 5560. Up to 1037 conditions per place. [2022-12-12 14:41:33,330 INFO L137 encePairwiseOnDemand]: 54/58 looper letters, 34 selfloop transitions, 3 changer transitions 8/52 dead transitions. [2022-12-12 14:41:33,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 209 flow [2022-12-12 14:41:33,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:41:33,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:41:33,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-12-12 14:41:33,331 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33620689655172414 [2022-12-12 14:41:33,331 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 74 flow. Second operand 4 states and 78 transitions. [2022-12-12 14:41:33,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 209 flow [2022-12-12 14:41:33,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 203 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:41:33,332 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 82 flow [2022-12-12 14:41:33,333 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2022-12-12 14:41:33,333 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -25 predicate places. [2022-12-12 14:41:33,333 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 82 flow [2022-12-12 14:41:33,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:41:33,333 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:41:33,334 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:41:33,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 14:41:33,334 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:41:33,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:41:33,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1160812512, now seen corresponding path program 1 times [2022-12-12 14:41:33,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:41:33,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39962289] [2022-12-12 14:41:33,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:41:33,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:41:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:41:34,256 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-12 14:41:34,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:41:34,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39962289] [2022-12-12 14:41:34,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39962289] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:41:34,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:41:34,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:41:34,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12548598] [2022-12-12 14:41:34,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:41:34,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:41:34,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:41:34,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:41:34,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:41:34,259 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 58 [2022-12-12 14:41:34,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 82 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-12 14:41:34,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:41:34,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 58 [2022-12-12 14:41:34,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:41:34,532 INFO L130 PetriNetUnfolder]: 846/1379 cut-off events. [2022-12-12 14:41:34,532 INFO L131 PetriNetUnfolder]: For 557/557 co-relation queries the response was YES. [2022-12-12 14:41:34,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3112 conditions, 1379 events. 846/1379 cut-off events. For 557/557 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 6531 event pairs, 476 based on Foata normal form. 8/1129 useless extension candidates. Maximal degree in co-relation 3099. Up to 1199 conditions per place. [2022-12-12 14:41:34,539 INFO L137 encePairwiseOnDemand]: 51/58 looper letters, 35 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2022-12-12 14:41:34,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 51 transitions, 222 flow [2022-12-12 14:41:34,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:41:34,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:41:34,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-12 14:41:34,542 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3103448275862069 [2022-12-12 14:41:34,542 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 82 flow. Second operand 5 states and 90 transitions. [2022-12-12 14:41:34,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 51 transitions, 222 flow [2022-12-12 14:41:34,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 206 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-12 14:41:34,547 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 124 flow [2022-12-12 14:41:34,547 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2022-12-12 14:41:34,548 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -23 predicate places. [2022-12-12 14:41:34,548 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 124 flow [2022-12-12 14:41:34,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-12 14:41:34,549 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:41:34,549 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:41:34,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 14:41:34,549 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:41:34,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:41:34,550 INFO L85 PathProgramCache]: Analyzing trace with hash 150906078, now seen corresponding path program 1 times [2022-12-12 14:41:34,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:41:34,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505924037] [2022-12-12 14:41:34,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:41:34,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:41:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:41:34,746 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-12 14:41:34,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:41:34,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505924037] [2022-12-12 14:41:34,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505924037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:41:34,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:41:34,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:41:34,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320762933] [2022-12-12 14:41:34,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:41:34,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:41:34,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:41:34,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:41:34,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:41:34,749 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 58 [2022-12-12 14:41:34,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:41:34,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:41:34,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 58 [2022-12-12 14:41:34,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:41:34,995 INFO L130 PetriNetUnfolder]: 1296/1985 cut-off events. [2022-12-12 14:41:34,996 INFO L131 PetriNetUnfolder]: For 1162/1162 co-relation queries the response was YES. [2022-12-12 14:41:34,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4974 conditions, 1985 events. 1296/1985 cut-off events. For 1162/1162 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 9257 event pairs, 413 based on Foata normal form. 24/1367 useless extension candidates. Maximal degree in co-relation 4960. Up to 1915 conditions per place. [2022-12-12 14:41:35,010 INFO L137 encePairwiseOnDemand]: 47/58 looper letters, 42 selfloop transitions, 10 changer transitions 0/57 dead transitions. [2022-12-12 14:41:35,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 297 flow [2022-12-12 14:41:35,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:41:35,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:41:35,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-12 14:41:35,012 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3448275862068966 [2022-12-12 14:41:35,012 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 124 flow. Second operand 3 states and 60 transitions. [2022-12-12 14:41:35,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 297 flow [2022-12-12 14:41:35,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 57 transitions, 297 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-12 14:41:35,015 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 192 flow [2022-12-12 14:41:35,015 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2022-12-12 14:41:35,017 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -20 predicate places. [2022-12-12 14:41:35,017 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 192 flow [2022-12-12 14:41:35,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:41:35,017 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:41:35,017 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:41:35,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 14:41:35,018 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:41:35,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:41:35,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1309413215, now seen corresponding path program 1 times [2022-12-12 14:41:35,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:41:35,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483308137] [2022-12-12 14:41:35,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:41:35,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:41:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:41:36,104 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-12 14:41:36,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:41:36,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483308137] [2022-12-12 14:41:36,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483308137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:41:36,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:41:36,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 14:41:36,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75635506] [2022-12-12 14:41:36,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:41:36,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 14:41:36,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:41:36,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 14:41:36,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-12 14:41:36,106 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 58 [2022-12-12 14:41:36,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 192 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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-12 14:41:36,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:41:36,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 58 [2022-12-12 14:41:36,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:41:36,433 INFO L130 PetriNetUnfolder]: 1176/1890 cut-off events. [2022-12-12 14:41:36,434 INFO L131 PetriNetUnfolder]: For 1229/1288 co-relation queries the response was YES. [2022-12-12 14:41:36,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5605 conditions, 1890 events. 1176/1890 cut-off events. For 1229/1288 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 9755 event pairs, 662 based on Foata normal form. 41/1541 useless extension candidates. Maximal degree in co-relation 5588. Up to 1362 conditions per place. [2022-12-12 14:41:36,443 INFO L137 encePairwiseOnDemand]: 52/58 looper letters, 52 selfloop transitions, 9 changer transitions 1/72 dead transitions. [2022-12-12 14:41:36,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 424 flow [2022-12-12 14:41:36,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:41:36,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:41:36,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-12 14:41:36,444 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3137931034482759 [2022-12-12 14:41:36,444 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 192 flow. Second operand 5 states and 91 transitions. [2022-12-12 14:41:36,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 424 flow [2022-12-12 14:41:36,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 406 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 14:41:36,447 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 223 flow [2022-12-12 14:41:36,447 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=223, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2022-12-12 14:41:36,447 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -15 predicate places. [2022-12-12 14:41:36,448 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 223 flow [2022-12-12 14:41:36,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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-12 14:41:36,448 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:41:36,448 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:41:36,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 14:41:36,448 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:41:36,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:41:36,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1917578547, now seen corresponding path program 1 times [2022-12-12 14:41:36,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:41:36,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276726883] [2022-12-12 14:41:36,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:41:36,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:41:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:41:36,564 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-12 14:41:36,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:41:36,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276726883] [2022-12-12 14:41:36,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276726883] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:41:36,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:41:36,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:41:36,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834273919] [2022-12-12 14:41:36,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:41:36,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:41:36,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:41:36,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:41:36,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:41:36,566 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 58 [2022-12-12 14:41:36,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 223 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-12 14:41:36,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:41:36,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 58 [2022-12-12 14:41:36,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:41:36,752 INFO L130 PetriNetUnfolder]: 707/1242 cut-off events. [2022-12-12 14:41:36,752 INFO L131 PetriNetUnfolder]: For 1855/1855 co-relation queries the response was YES. [2022-12-12 14:41:36,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4297 conditions, 1242 events. 707/1242 cut-off events. For 1855/1855 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 6360 event pairs, 99 based on Foata normal form. 81/937 useless extension candidates. Maximal degree in co-relation 4277. Up to 973 conditions per place. [2022-12-12 14:41:36,757 INFO L137 encePairwiseOnDemand]: 47/58 looper letters, 52 selfloop transitions, 19 changer transitions 0/75 dead transitions. [2022-12-12 14:41:36,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 516 flow [2022-12-12 14:41:36,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:41:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:41:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-12-12 14:41:36,759 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3448275862068966 [2022-12-12 14:41:36,759 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 223 flow. Second operand 4 states and 80 transitions. [2022-12-12 14:41:36,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 516 flow [2022-12-12 14:41:36,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 75 transitions, 482 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-12 14:41:36,764 INFO L231 Difference]: Finished difference. Result has 53 places, 55 transitions, 315 flow [2022-12-12 14:41:36,765 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=315, PETRI_PLACES=53, PETRI_TRANSITIONS=55} [2022-12-12 14:41:36,765 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -15 predicate places. [2022-12-12 14:41:36,765 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 55 transitions, 315 flow [2022-12-12 14:41:36,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-12 14:41:36,765 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:41:36,765 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:41:36,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 14:41:36,766 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:41:36,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:41:36,766 INFO L85 PathProgramCache]: Analyzing trace with hash 529952166, now seen corresponding path program 1 times [2022-12-12 14:41:36,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:41:36,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833195518] [2022-12-12 14:41:36,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:41:36,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:41:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:41:36,941 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-12 14:41:36,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:41:36,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833195518] [2022-12-12 14:41:36,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833195518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:41:36,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:41:36,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:41:36,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880565028] [2022-12-12 14:41:36,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:41:36,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:41:36,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:41:36,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:41:36,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:41:36,943 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 58 [2022-12-12 14:41:36,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 55 transitions, 315 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-12 14:41:36,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:41:36,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 58 [2022-12-12 14:41:36,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:41:37,074 INFO L130 PetriNetUnfolder]: 329/649 cut-off events. [2022-12-12 14:41:37,074 INFO L131 PetriNetUnfolder]: For 610/610 co-relation queries the response was YES. [2022-12-12 14:41:37,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2607 conditions, 649 events. 329/649 cut-off events. For 610/610 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3073 event pairs, 18 based on Foata normal form. 81/506 useless extension candidates. Maximal degree in co-relation 2587. Up to 358 conditions per place. [2022-12-12 14:41:37,078 INFO L137 encePairwiseOnDemand]: 47/58 looper letters, 43 selfloop transitions, 28 changer transitions 0/75 dead transitions. [2022-12-12 14:41:37,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 75 transitions, 558 flow [2022-12-12 14:41:37,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:41:37,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:41:37,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-12-12 14:41:37,079 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.296551724137931 [2022-12-12 14:41:37,079 INFO L175 Difference]: Start difference. First operand has 53 places, 55 transitions, 315 flow. Second operand 5 states and 86 transitions. [2022-12-12 14:41:37,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 75 transitions, 558 flow [2022-12-12 14:41:37,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 504 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-12 14:41:37,082 INFO L231 Difference]: Finished difference. Result has 54 places, 55 transitions, 342 flow [2022-12-12 14:41:37,082 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=342, PETRI_PLACES=54, PETRI_TRANSITIONS=55} [2022-12-12 14:41:37,082 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -14 predicate places. [2022-12-12 14:41:37,083 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 55 transitions, 342 flow [2022-12-12 14:41:37,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-12 14:41:37,083 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:41:37,083 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:41:37,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 14:41:37,083 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:41:37,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:41:37,083 INFO L85 PathProgramCache]: Analyzing trace with hash 572422442, now seen corresponding path program 1 times [2022-12-12 14:41:37,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:41:37,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962431829] [2022-12-12 14:41:37,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:41:37,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:41:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:41:38,431 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-12 14:41:38,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:41:38,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962431829] [2022-12-12 14:41:38,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962431829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:41:38,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:41:38,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 14:41:38,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367740507] [2022-12-12 14:41:38,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:41:38,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 14:41:38,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:41:38,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 14:41:38,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-12 14:41:38,434 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 58 [2022-12-12 14:41:38,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 55 transitions, 342 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 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-12 14:41:38,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:41:38,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 58 [2022-12-12 14:41:38,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:41:39,010 INFO L130 PetriNetUnfolder]: 700/1527 cut-off events. [2022-12-12 14:41:39,010 INFO L131 PetriNetUnfolder]: For 1875/1976 co-relation queries the response was YES. [2022-12-12 14:41:39,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6161 conditions, 1527 events. 700/1527 cut-off events. For 1875/1976 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 10737 event pairs, 94 based on Foata normal form. 101/1290 useless extension candidates. Maximal degree in co-relation 6142. Up to 899 conditions per place. [2022-12-12 14:41:39,017 INFO L137 encePairwiseOnDemand]: 51/58 looper letters, 70 selfloop transitions, 9 changer transitions 57/149 dead transitions. [2022-12-12 14:41:39,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 149 transitions, 1259 flow [2022-12-12 14:41:39,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 14:41:39,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 14:41:39,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2022-12-12 14:41:39,018 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3146551724137931 [2022-12-12 14:41:39,018 INFO L175 Difference]: Start difference. First operand has 54 places, 55 transitions, 342 flow. Second operand 8 states and 146 transitions. [2022-12-12 14:41:39,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 149 transitions, 1259 flow [2022-12-12 14:41:39,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 149 transitions, 1017 flow, removed 54 selfloop flow, removed 3 redundant places. [2022-12-12 14:41:39,033 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 323 flow [2022-12-12 14:41:39,033 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=323, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2022-12-12 14:41:39,034 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -5 predicate places. [2022-12-12 14:41:39,034 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 323 flow [2022-12-12 14:41:39,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 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-12 14:41:39,034 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:41:39,034 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:41:39,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 14:41:39,034 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:41:39,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:41:39,035 INFO L85 PathProgramCache]: Analyzing trace with hash 325586781, now seen corresponding path program 1 times [2022-12-12 14:41:39,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:41:39,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605242695] [2022-12-12 14:41:39,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:41:39,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:41:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:41:40,470 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-12 14:41:40,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:41:40,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605242695] [2022-12-12 14:41:40,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605242695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:41:40,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:41:40,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 14:41:40,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211334245] [2022-12-12 14:41:40,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:41:40,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 14:41:40,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:41:40,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 14:41:40,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-12 14:41:40,472 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 58 [2022-12-12 14:41:40,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 323 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 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-12 14:41:40,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:41:40,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 58 [2022-12-12 14:41:40,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:41:40,959 INFO L130 PetriNetUnfolder]: 889/1843 cut-off events. [2022-12-12 14:41:40,960 INFO L131 PetriNetUnfolder]: For 2377/2453 co-relation queries the response was YES. [2022-12-12 14:41:40,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6412 conditions, 1843 events. 889/1843 cut-off events. For 2377/2453 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 13141 event pairs, 58 based on Foata normal form. 75/1491 useless extension candidates. Maximal degree in co-relation 6388. Up to 696 conditions per place. [2022-12-12 14:41:40,970 INFO L137 encePairwiseOnDemand]: 49/58 looper letters, 93 selfloop transitions, 16 changer transitions 13/135 dead transitions. [2022-12-12 14:41:40,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 135 transitions, 985 flow [2022-12-12 14:41:40,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 14:41:40,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 14:41:40,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2022-12-12 14:41:40,972 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30603448275862066 [2022-12-12 14:41:40,972 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 323 flow. Second operand 8 states and 142 transitions. [2022-12-12 14:41:40,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 135 transitions, 985 flow [2022-12-12 14:41:40,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 135 transitions, 964 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-12 14:41:40,987 INFO L231 Difference]: Finished difference. Result has 67 places, 67 transitions, 428 flow [2022-12-12 14:41:40,988 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=428, PETRI_PLACES=67, PETRI_TRANSITIONS=67} [2022-12-12 14:41:40,989 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2022-12-12 14:41:40,989 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 67 transitions, 428 flow [2022-12-12 14:41:40,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 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-12 14:41:40,989 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:41:40,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] [2022-12-12 14:41:40,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 14:41:40,989 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:41:40,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:41:40,990 INFO L85 PathProgramCache]: Analyzing trace with hash 318245323, now seen corresponding path program 2 times [2022-12-12 14:41:40,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:41:40,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965208263] [2022-12-12 14:41:40,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:41:40,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:41:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:41:41,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 14:41:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:41:41,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 14:41:41,156 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 14:41:41,157 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 14:41:41,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 14:41:41,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 14:41:41,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 14:41:41,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 14:41:41,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 14:41:41,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 14:41:41,158 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:41:41,162 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 14:41:41,162 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 14:41:41,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 02:41:41 BasicIcfg [2022-12-12 14:41:41,228 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 14:41:41,228 INFO L158 Benchmark]: Toolchain (without parser) took 22687.89ms. Allocated memory was 182.5MB in the beginning and 1.1GB in the end (delta: 939.5MB). Free memory was 156.5MB in the beginning and 715.2MB in the end (delta: -558.7MB). Peak memory consumption was 381.9MB. Max. memory is 8.0GB. [2022-12-12 14:41:41,229 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 127.9MB. Free memory is still 108.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 14:41:41,229 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.86ms. Allocated memory is still 182.5MB. Free memory was 156.5MB in the beginning and 128.2MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-12 14:41:41,229 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.87ms. Allocated memory is still 182.5MB. Free memory was 128.2MB in the beginning and 125.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 14:41:41,229 INFO L158 Benchmark]: Boogie Preprocessor took 42.50ms. Allocated memory is still 182.5MB. Free memory was 125.5MB in the beginning and 123.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 14:41:41,229 INFO L158 Benchmark]: RCFGBuilder took 764.64ms. Allocated memory is still 182.5MB. Free memory was 123.5MB in the beginning and 93.4MB in the end (delta: 30.1MB). Peak memory consumption was 31.7MB. Max. memory is 8.0GB. [2022-12-12 14:41:41,229 INFO L158 Benchmark]: TraceAbstraction took 21355.67ms. Allocated memory was 182.5MB in the beginning and 1.1GB in the end (delta: 939.5MB). Free memory was 92.3MB in the beginning and 715.2MB in the end (delta: -622.9MB). Peak memory consumption was 316.6MB. Max. memory is 8.0GB. [2022-12-12 14:41:41,230 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 127.9MB. Free memory is still 108.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 482.86ms. Allocated memory is still 182.5MB. Free memory was 156.5MB in the beginning and 128.2MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.87ms. Allocated memory is still 182.5MB. Free memory was 128.2MB in the beginning and 125.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.50ms. Allocated memory is still 182.5MB. Free memory was 125.5MB in the beginning and 123.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 764.64ms. Allocated memory is still 182.5MB. Free memory was 123.5MB in the beginning and 93.4MB in the end (delta: 30.1MB). Peak memory consumption was 31.7MB. Max. memory is 8.0GB. * TraceAbstraction took 21355.67ms. Allocated memory was 182.5MB in the beginning and 1.1GB in the end (delta: 939.5MB). Free memory was 92.3MB in the beginning and 715.2MB in the end (delta: -622.9MB). Peak memory consumption was 316.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.2s, 130 PlacesBefore, 68 PlacesAfterwards, 122 TransitionsBefore, 58 TransitionsAfterwards, 1692 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 57 TrivialYvCompositions, 42 ConcurrentYvCompositions, 4 ChoiceCompositions, 105 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3104, independent: 2930, independent conditional: 2930, independent unconditional: 0, dependent: 174, dependent conditional: 174, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3104, independent: 2930, independent conditional: 0, independent unconditional: 2930, dependent: 174, dependent conditional: 0, dependent unconditional: 174, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3104, independent: 2930, independent conditional: 0, independent unconditional: 2930, dependent: 174, dependent conditional: 0, dependent unconditional: 174, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3104, independent: 2930, independent conditional: 0, independent unconditional: 2930, dependent: 174, dependent conditional: 0, dependent unconditional: 174, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1638, independent: 1582, independent conditional: 0, independent unconditional: 1582, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1638, independent: 1570, independent conditional: 0, independent unconditional: 1570, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 530, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 495, dependent conditional: 0, dependent unconditional: 495, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3104, independent: 1348, independent conditional: 0, independent unconditional: 1348, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 1638, unknown conditional: 0, unknown unconditional: 1638] , Statistics on independence cache: Total cache size (in pairs): 3152, Positive cache size: 3096, Positive conditional cache size: 0, Positive unconditional cache size: 3096, Negative cache size: 56, Negative conditional cache size: 0, Negative unconditional cache size: 56, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L718] 0 int __unbuffered_p2_EAX$mem_tmp; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L859] 0 pthread_t t2204; [L860] FCALL, FORK 0 pthread_create(&t2204, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2204, ((void *)0), P0, ((void *)0))=-3, t2204={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L861] 0 pthread_t t2205; [L862] FCALL, FORK 0 pthread_create(&t2205, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2205, ((void *)0), P1, ((void *)0))=-2, t2204={6:0}, t2205={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L863] 0 pthread_t t2206; [L864] FCALL, FORK 0 pthread_create(&t2206, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2206, ((void *)0), P2, ((void *)0))=-1, t2204={6:0}, t2205={7:0}, t2206={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] 2 x$w_buff1 = x$w_buff0 [L790] 2 x$w_buff0 = 1 [L791] 2 x$w_buff1_used = x$w_buff0_used [L792] 2 x$w_buff0_used = (_Bool)1 [L793] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L793] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L794] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L795] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L796] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L797] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L798] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 x$flush_delayed = weak$$choice2 [L818] EXPR 3 \read(x) [L818] 3 x$mem_tmp = x [L819] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L820] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L820] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L820] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L820] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L820] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L821] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L822] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L823] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L824] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L825] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L826] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L827] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L828] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L829] EXPR 3 \read(x) [L829] 3 __unbuffered_p2_EAX = x [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] 3 x = x$flush_delayed ? x$mem_tmp : x [L831] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L834] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L761] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EBX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 1 \read(x) [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L801] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L802] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L803] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L804] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L805] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 \read(x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L838] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L839] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L840] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L841] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L844] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 \read(x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2204={6:0}, t2205={7:0}, t2206={5:0}, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L877] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L879] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 862]: 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: 864]: 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: 860]: 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, 150 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: 21.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 280 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 280 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1311 IncrementalHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 1 mSDtfsCounter, 1311 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=428occurred in iteration=10, InterpolantAutomatonStates: 48, 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, 5.5s InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 2153 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-12 14:41:41,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...