/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/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix031.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7707f89-m [2022-11-16 02:57:20,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 02:57:20,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 02:57:21,021 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 02:57:21,022 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 02:57:21,024 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 02:57:21,026 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 02:57:21,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 02:57:21,028 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 02:57:21,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 02:57:21,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 02:57:21,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 02:57:21,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 02:57:21,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 02:57:21,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 02:57:21,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 02:57:21,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 02:57:21,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 02:57:21,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 02:57:21,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 02:57:21,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 02:57:21,039 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 02:57:21,040 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 02:57:21,040 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 02:57:21,043 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 02:57:21,043 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 02:57:21,043 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 02:57:21,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 02:57:21,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 02:57:21,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 02:57:21,045 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 02:57:21,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 02:57:21,046 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 02:57:21,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 02:57:21,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 02:57:21,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 02:57:21,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 02:57:21,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 02:57:21,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 02:57:21,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 02:57:21,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 02:57:21,058 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-11-16 02:57:21,085 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 02:57:21,085 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 02:57:21,085 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 02:57:21,086 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 02:57:21,086 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 02:57:21,086 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 02:57:21,087 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 02:57:21,087 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 02:57:21,087 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 02:57:21,087 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 02:57:21,088 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 02:57:21,088 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 02:57:21,088 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 02:57:21,088 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 02:57:21,088 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 02:57:21,088 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 02:57:21,088 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 02:57:21,089 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 02:57:21,089 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 02:57:21,089 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 02:57:21,089 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 02:57:21,089 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 02:57:21,089 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 02:57:21,090 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-16 02:57:21,090 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 02:57:21,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 02:57:21,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 02:57:21,091 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 02:57:21,091 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 02:57:21,091 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 02:57:21,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 02:57:21,091 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 02:57:21,092 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-16 02:57:21,092 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 02:57:21,092 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-16 02:57:21,092 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-16 02:57:21,092 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP [2022-11-16 02:57:21,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 02:57:21,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 02:57:21,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 02:57:21,275 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 02:57:21,275 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 02:57:21,276 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031.opt.i [2022-11-16 02:57:21,342 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e0da04cc/035b15692a2a45dd8d74172489d36295/FLAGf42b9a983 [2022-11-16 02:57:21,722 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 02:57:21,723 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031.opt.i [2022-11-16 02:57:21,738 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e0da04cc/035b15692a2a45dd8d74172489d36295/FLAGf42b9a983 [2022-11-16 02:57:22,100 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e0da04cc/035b15692a2a45dd8d74172489d36295 [2022-11-16 02:57:22,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 02:57:22,103 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-16 02:57:22,104 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 02:57:22,104 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 02:57:22,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 02:57:22,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:57:22" (1/1) ... [2022-11-16 02:57:22,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e7e41f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:57:22, skipping insertion in model container [2022-11-16 02:57:22,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:57:22" (1/1) ... [2022-11-16 02:57:22,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 02:57:22,149 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 02:57:22,356 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031.opt.i[987,1000] [2022-11-16 02:57:22,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 02:57:22,522 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 02:57:22,530 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031.opt.i[987,1000] [2022-11-16 02:57:22,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 02:57:22,585 INFO L208 MainTranslator]: Completed translation [2022-11-16 02:57:22,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:57:22 WrapperNode [2022-11-16 02:57:22,586 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 02:57:22,587 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 02:57:22,587 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 02:57:22,587 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 02:57:22,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:57:22" (1/1) ... [2022-11-16 02:57:22,621 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:57:22" (1/1) ... [2022-11-16 02:57:22,649 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 123 [2022-11-16 02:57:22,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 02:57:22,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 02:57:22,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 02:57:22,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 02:57:22,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:57:22" (1/1) ... [2022-11-16 02:57:22,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:57:22" (1/1) ... [2022-11-16 02:57:22,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:57:22" (1/1) ... [2022-11-16 02:57:22,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:57:22" (1/1) ... [2022-11-16 02:57:22,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:57:22" (1/1) ... [2022-11-16 02:57:22,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:57:22" (1/1) ... [2022-11-16 02:57:22,685 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:57:22" (1/1) ... [2022-11-16 02:57:22,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:57:22" (1/1) ... [2022-11-16 02:57:22,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 02:57:22,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 02:57:22,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 02:57:22,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 02:57:22,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:57:22" (1/1) ... [2022-11-16 02:57:22,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 02:57:22,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 02:57:22,737 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-11-16 02:57:22,795 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-11-16 02:57:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 02:57:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 02:57:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 02:57:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 02:57:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 02:57:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 02:57:22,821 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 02:57:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 02:57:22,821 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 02:57:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 02:57:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 02:57:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 02:57:22,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 02:57:22,823 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 02:57:22,937 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 02:57:22,939 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 02:57:23,219 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 02:57:23,330 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 02:57:23,331 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 02:57:23,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 02:57:23 BoogieIcfgContainer [2022-11-16 02:57:23,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 02:57:23,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 02:57:23,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 02:57:23,338 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 02:57:23,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:57:22" (1/3) ... [2022-11-16 02:57:23,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d4798c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:57:23, skipping insertion in model container [2022-11-16 02:57:23,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:57:22" (2/3) ... [2022-11-16 02:57:23,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d4798c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:57:23, skipping insertion in model container [2022-11-16 02:57:23,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 02:57:23" (3/3) ... [2022-11-16 02:57:23,340 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.opt.i [2022-11-16 02:57:23,346 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 02:57:23,353 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 02:57:23,353 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 02:57:23,353 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 02:57:23,409 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 02:57:23,451 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 02:57:23,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-16 02:57:23,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 02:57:23,454 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-16 02:57:23,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-16 02:57:23,526 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-16 02:57:23,539 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-16 02:57:23,544 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=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@26808140, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 02:57:23,544 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-16 02:57:23,713 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 02:57:23,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:57:23,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1747265663, now seen corresponding path program 1 times [2022-11-16 02:57:23,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:57:23,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162310226] [2022-11-16 02:57:23,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:57:23,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:57:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:57:23,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 02:57:23,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:57:23,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162310226] [2022-11-16 02:57:23,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162310226] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:57:23,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:57:23,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 02:57:23,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363816183] [2022-11-16 02:57:23,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:57:23,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 02:57:23,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:57:23,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 02:57:24,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 02:57:24,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:57:24,002 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:57:24,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 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-11-16 02:57:24,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:57:24,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:57:24,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 02:57:24,042 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 02:57:24,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:57:24,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1335258606, now seen corresponding path program 1 times [2022-11-16 02:57:24,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:57:24,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882102357] [2022-11-16 02:57:24,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:57:24,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:57:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:57:24,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 02:57:24,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:57:24,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882102357] [2022-11-16 02:57:24,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882102357] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:57:24,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:57:24,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 02:57:24,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178965285] [2022-11-16 02:57:24,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:57:24,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 02:57:24,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:57:24,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 02:57:24,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 02:57:24,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:57:24,467 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:57:24,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-11-16 02:57:24,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:57:24,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:57:24,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:57:24,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:57:24,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 02:57:24,580 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 02:57:24,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:57:24,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1897939829, now seen corresponding path program 1 times [2022-11-16 02:57:24,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:57:24,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318151435] [2022-11-16 02:57:24,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:57:24,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:57:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:57:24,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 02:57:24,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:57:24,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318151435] [2022-11-16 02:57:24,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318151435] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:57:24,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:57:24,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 02:57:24,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818629081] [2022-11-16 02:57:24,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:57:24,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 02:57:24,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:57:24,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 02:57:24,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 02:57:24,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:57:24,858 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:57:24,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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-11-16 02:57:24,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:57:24,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:57:24,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:57:24,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:57:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:57:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 02:57:24,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 02:57:24,981 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 02:57:24,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:57:24,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1771964855, now seen corresponding path program 1 times [2022-11-16 02:57:24,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:57:24,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856092910] [2022-11-16 02:57:24,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:57:24,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:57:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:57:25,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 02:57:25,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:57:25,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856092910] [2022-11-16 02:57:25,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856092910] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:57:25,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:57:25,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 02:57:25,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857628855] [2022-11-16 02:57:25,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:57:25,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 02:57:25,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:57:25,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 02:57:25,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 02:57:25,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:57:25,232 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:57:25,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-11-16 02:57:25,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:57:25,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:57:25,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-16 02:57:25,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:57:25,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:57:25,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:57:25,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 02:57:25,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 02:57:25,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 02:57:25,346 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 02:57:25,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:57:25,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1856582056, now seen corresponding path program 1 times [2022-11-16 02:57:25,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:57:25,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533953962] [2022-11-16 02:57:25,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:57:25,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:57:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 02:57:25,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 02:57:25,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 02:57:25,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533953962] [2022-11-16 02:57:25,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533953962] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 02:57:25,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 02:57:25,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 02:57:25,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906349158] [2022-11-16 02:57:25,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 02:57:25,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 02:57:25,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 02:57:25,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 02:57:25,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-16 02:57:25,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:57:25,888 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 02:57:25,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 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-11-16 02:57:25,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:57:25,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:57:25,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-16 02:57:25,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 02:57:25,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:57:26,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 02:57:26,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 02:57:26,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 02:57:26,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 02:57:26,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 02:57:26,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 02:57:26,159 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 02:57:26,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 02:57:26,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1828644332, now seen corresponding path program 2 times [2022-11-16 02:57:26,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 02:57:26,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838270866] [2022-11-16 02:57:26,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 02:57:26,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 02:57:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 02:57:26,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 02:57:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 02:57:26,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 02:57:26,267 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 02:57:26,268 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-11-16 02:57:26,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-11-16 02:57:26,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-11-16 02:57:26,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 02:57:26,273 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-11-16 02:57:26,274 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (1/2) [2022-11-16 02:57:26,277 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 02:57:26,277 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 02:57:26,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 02:57:26 BasicIcfg [2022-11-16 02:57:26,337 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 02:57:26,337 INFO L158 Benchmark]: Toolchain (without parser) took 4234.32ms. Allocated memory was 173.0MB in the beginning and 274.7MB in the end (delta: 101.7MB). Free memory was 149.8MB in the beginning and 145.1MB in the end (delta: 4.8MB). Peak memory consumption was 106.9MB. Max. memory is 8.0GB. [2022-11-16 02:57:26,337 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 173.0MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-11-16 02:57:26,338 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.91ms. Allocated memory is still 173.0MB. Free memory was 149.5MB in the beginning and 138.5MB in the end (delta: 10.9MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-11-16 02:57:26,338 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.12ms. Allocated memory is still 173.0MB. Free memory was 138.5MB in the beginning and 136.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-16 02:57:26,338 INFO L158 Benchmark]: Boogie Preprocessor took 37.93ms. Allocated memory is still 173.0MB. Free memory was 136.1MB in the beginning and 134.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-11-16 02:57:26,338 INFO L158 Benchmark]: RCFGBuilder took 644.17ms. Allocated memory is still 173.0MB. Free memory was 134.3MB in the beginning and 107.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-11-16 02:57:26,339 INFO L158 Benchmark]: TraceAbstraction took 3002.67ms. Allocated memory was 173.0MB in the beginning and 274.7MB in the end (delta: 101.7MB). Free memory was 106.4MB in the beginning and 145.1MB in the end (delta: -38.7MB). Peak memory consumption was 63.5MB. Max. memory is 8.0GB. [2022-11-16 02:57:26,340 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.09ms. Allocated memory is still 173.0MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 482.91ms. Allocated memory is still 173.0MB. Free memory was 149.5MB in the beginning and 138.5MB in the end (delta: 10.9MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.12ms. Allocated memory is still 173.0MB. Free memory was 138.5MB in the beginning and 136.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.93ms. Allocated memory is still 173.0MB. Free memory was 136.1MB in the beginning and 134.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 644.17ms. Allocated memory is still 173.0MB. Free memory was 134.3MB in the beginning and 107.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 3002.67ms. Allocated memory was 173.0MB in the beginning and 274.7MB in the end (delta: 101.7MB). Free memory was 106.4MB in the beginning and 145.1MB in the end (delta: -38.7MB). Peak memory consumption was 63.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1642, independent: 1586, independent conditional: 723, independent unconditional: 863, dependent: 56, dependent conditional: 37, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1621, independent: 1586, independent conditional: 723, independent unconditional: 863, dependent: 35, dependent conditional: 16, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1621, independent: 1586, independent conditional: 723, independent unconditional: 863, dependent: 35, dependent conditional: 16, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1660, independent: 1586, independent conditional: 5, independent unconditional: 1581, dependent: 74, dependent conditional: 34, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1660, independent: 1586, independent conditional: 5, independent unconditional: 1581, dependent: 74, dependent conditional: 15, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1660, independent: 1586, independent conditional: 5, independent unconditional: 1581, dependent: 74, dependent conditional: 15, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 888, independent: 866, independent conditional: 3, independent unconditional: 863, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 888, independent: 860, independent conditional: 0, independent unconditional: 860, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 28, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 182, independent: 36, independent conditional: 4, independent unconditional: 32, dependent: 146, dependent conditional: 17, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1660, independent: 720, independent conditional: 2, independent unconditional: 718, dependent: 52, dependent conditional: 12, dependent unconditional: 40, unknown: 888, unknown conditional: 6, unknown unconditional: 882] , Statistics on independence cache: Total cache size (in pairs): 888, Positive cache size: 866, Positive conditional cache size: 3, Positive unconditional cache size: 863, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 2, Independence queries for same thread: 21 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 264, Number of trivial persistent sets: 117, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 882, independent: 863, independent conditional: 0, independent unconditional: 863, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1642, independent: 1586, independent conditional: 723, independent unconditional: 863, dependent: 56, dependent conditional: 37, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1621, independent: 1586, independent conditional: 723, independent unconditional: 863, dependent: 35, dependent conditional: 16, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1621, independent: 1586, independent conditional: 723, independent unconditional: 863, dependent: 35, dependent conditional: 16, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1660, independent: 1586, independent conditional: 5, independent unconditional: 1581, dependent: 74, dependent conditional: 34, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1660, independent: 1586, independent conditional: 5, independent unconditional: 1581, dependent: 74, dependent conditional: 15, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1660, independent: 1586, independent conditional: 5, independent unconditional: 1581, dependent: 74, dependent conditional: 15, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 888, independent: 866, independent conditional: 3, independent unconditional: 863, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 888, independent: 860, independent conditional: 0, independent unconditional: 860, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 28, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 182, independent: 36, independent conditional: 4, independent unconditional: 32, dependent: 146, dependent conditional: 17, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1660, independent: 720, independent conditional: 2, independent unconditional: 718, dependent: 52, dependent conditional: 12, dependent unconditional: 40, unknown: 888, unknown conditional: 6, unknown unconditional: 882] , Statistics on independence cache: Total cache size (in pairs): 888, Positive cache size: 866, Positive conditional cache size: 3, Positive unconditional cache size: 863, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 2, Independence queries for same thread: 21 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L742] 0 _Bool weak$$choice0; VAL [weak$$choice0=0] [L743] 0 _Bool weak$$choice2; VAL [weak$$choice0=0, weak$$choice2=0] [L736] 0 int y$w_buff0; VAL [weak$$choice0=0, weak$$choice2=0, y$w_buff0=0] [L738] 0 int y$w_buff1; VAL [weak$$choice0=0, weak$$choice2=0, y$w_buff0=0, y$w_buff1=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, y$w_buff0=0, y$w_buff1=0] [L730] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L727] 0 int y$mem_tmp; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L715] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L728] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L729] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L734] 0 _Bool y$read_delayed; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L719] 0 int a = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, a=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, a=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L726] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, a=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L713] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, a=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L739] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, a=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, a=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L737] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L723] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L731] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L725] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L732] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L823] 0 pthread_t t835; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t835={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] FCALL, FORK 0 pthread_create(&t835, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t835, ((void *)0), P0, ((void *)0))=-1, t835={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t836; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t835={5:0}, t836={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t836, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t836, ((void *)0), P1, ((void *)0))=0, t835={5:0}, t836={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 2 y$w_buff1 = y$w_buff0 [L782] 2 y$w_buff0 = 1 [L783] 2 y$w_buff1_used = y$w_buff0_used [L784] 2 y$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L786] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L787] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L788] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L789] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 y$flush_delayed = weak$$choice2 [L759] 1 y$mem_tmp = y [L760] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L761] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L762] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L763] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L764] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L766] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EBX = y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L805] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 2 return 0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835={5:0}, t836={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] RET 0 assume_abort_if_not(main$tmp_guard0) [L832] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835={5:0}, t836={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835={5:0}, t836={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L841] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 826]: 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: 824]: 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 for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 123 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 34, 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.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 465 NumberOfCodeBlocks, 465 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 377 ConstructedInterpolants, 0 QuantifiedInterpolants, 1207 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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-11-16 02:57:26,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-11-16 02:57:26,563 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...