/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.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.trace.refinement.strategy BADGER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/pthread-deagle/airline-5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-44940e9-m [2022-11-09 19:45:08,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-09 19:45:08,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-09 19:45:08,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-09 19:45:08,595 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-09 19:45:08,598 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-09 19:45:08,600 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-09 19:45:08,602 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-09 19:45:08,604 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-09 19:45:08,608 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-09 19:45:08,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-09 19:45:08,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-09 19:45:08,610 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-09 19:45:08,611 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-09 19:45:08,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-09 19:45:08,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-09 19:45:08,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-09 19:45:08,614 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-09 19:45:08,616 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-09 19:45:08,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-09 19:45:08,621 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-09 19:45:08,622 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-09 19:45:08,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-09 19:45:08,623 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-09 19:45:08,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-09 19:45:08,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-09 19:45:08,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-09 19:45:08,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-09 19:45:08,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-09 19:45:08,630 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-09 19:45:08,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-09 19:45:08,631 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-09 19:45:08,632 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-09 19:45:08,633 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-09 19:45:08,633 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-09 19:45:08,634 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-09 19:45:08,634 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-09 19:45:08,634 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-09 19:45:08,634 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-09 19:45:08,635 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-09 19:45:08,635 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-09 19:45:08,636 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-11-09 19:45:08,658 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-09 19:45:08,658 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-09 19:45:08,659 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-09 19:45:08,659 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-09 19:45:08,660 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-09 19:45:08,660 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-09 19:45:08,660 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-09 19:45:08,660 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-09 19:45:08,660 INFO L138 SettingsManager]: * Use SBE=true [2022-11-09 19:45:08,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-09 19:45:08,661 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-09 19:45:08,661 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-09 19:45:08,661 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-09 19:45:08,661 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-09 19:45:08,661 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-09 19:45:08,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-09 19:45:08,661 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-09 19:45:08,661 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-09 19:45:08,662 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-09 19:45:08,662 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-09 19:45:08,662 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-09 19:45:08,662 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-09 19:45:08,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-09 19:45:08,663 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-09 19:45:08,663 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-09 19:45:08,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-09 19:45:08,663 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-09 19:45:08,663 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-09 19:45:08,663 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-09 19:45:08,663 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-09 19:45:08,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-09 19:45:08,663 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-09 19:45:08,664 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-09 19:45:08,664 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-09 19:45:08,664 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-09 19:45:08,664 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-09 19:45:08,664 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: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> BADGER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-11-09 19:45:08,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-09 19:45:08,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-09 19:45:08,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-09 19:45:08,866 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-09 19:45:08,867 INFO L275 PluginConnector]: CDTParser initialized [2022-11-09 19:45:08,868 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/airline-5.i [2022-11-09 19:45:08,905 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba10bfb84/8c1b9ab0d66e4ad8aec3191d608cf524/FLAG4f0a50663 [2022-11-09 19:45:09,337 INFO L306 CDTParser]: Found 1 translation units. [2022-11-09 19:45:09,337 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/airline-5.i [2022-11-09 19:45:09,356 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba10bfb84/8c1b9ab0d66e4ad8aec3191d608cf524/FLAG4f0a50663 [2022-11-09 19:45:09,706 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba10bfb84/8c1b9ab0d66e4ad8aec3191d608cf524 [2022-11-09 19:45:09,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-09 19:45:09,708 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-09 19:45:09,709 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-09 19:45:09,709 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-09 19:45:09,711 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-09 19:45:09,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:45:09" (1/1) ... [2022-11-09 19:45:09,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@667a9901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:09, skipping insertion in model container [2022-11-09 19:45:09,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:45:09" (1/1) ... [2022-11-09 19:45:09,716 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-09 19:45:09,735 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-09 19:45:09,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/airline-5.i[32089,32102] [2022-11-09 19:45:09,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-09 19:45:09,951 INFO L203 MainTranslator]: Completed pre-run [2022-11-09 19:45:09,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/airline-5.i[32089,32102] [2022-11-09 19:45:09,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-09 19:45:09,997 INFO L208 MainTranslator]: Completed translation [2022-11-09 19:45:09,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:09 WrapperNode [2022-11-09 19:45:09,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-09 19:45:09,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-09 19:45:09,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-09 19:45:09,998 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-09 19:45:10,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:09" (1/1) ... [2022-11-09 19:45:10,036 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:09" (1/1) ... [2022-11-09 19:45:10,059 INFO L138 Inliner]: procedures = 162, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2022-11-09 19:45:10,059 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-09 19:45:10,060 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-09 19:45:10,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-09 19:45:10,060 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-09 19:45:10,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:09" (1/1) ... [2022-11-09 19:45:10,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:09" (1/1) ... [2022-11-09 19:45:10,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:09" (1/1) ... [2022-11-09 19:45:10,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:09" (1/1) ... [2022-11-09 19:45:10,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:09" (1/1) ... [2022-11-09 19:45:10,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:09" (1/1) ... [2022-11-09 19:45:10,100 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:09" (1/1) ... [2022-11-09 19:45:10,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:09" (1/1) ... [2022-11-09 19:45:10,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-09 19:45:10,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-09 19:45:10,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-09 19:45:10,104 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-09 19:45:10,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:09" (1/1) ... [2022-11-09 19:45:10,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-09 19:45:10,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 19:45:10,127 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-09 19:45:10,132 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-09 19:45:10,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-09 19:45:10,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-09 19:45:10,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-09 19:45:10,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-09 19:45:10,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-09 19:45:10,159 INFO L130 BoogieDeclarations]: Found specification of procedure salethread [2022-11-09 19:45:10,159 INFO L138 BoogieDeclarations]: Found implementation of procedure salethread [2022-11-09 19:45:10,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-09 19:45:10,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-09 19:45:10,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-09 19:45:10,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-09 19:45:10,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-09 19:45:10,161 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-09 19:45:10,284 INFO L235 CfgBuilder]: Building ICFG [2022-11-09 19:45:10,285 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-09 19:45:10,428 INFO L276 CfgBuilder]: Performing block encoding [2022-11-09 19:45:10,461 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-09 19:45:10,461 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-09 19:45:10,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:45:10 BoogieIcfgContainer [2022-11-09 19:45:10,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-09 19:45:10,464 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-09 19:45:10,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-09 19:45:10,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-09 19:45:10,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:45:09" (1/3) ... [2022-11-09 19:45:10,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11580a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:45:10, skipping insertion in model container [2022-11-09 19:45:10,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:45:09" (2/3) ... [2022-11-09 19:45:10,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11580a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:45:10, skipping insertion in model container [2022-11-09 19:45:10,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:45:10" (3/3) ... [2022-11-09 19:45:10,482 INFO L112 eAbstractionObserver]: Analyzing ICFG airline-5.i [2022-11-09 19:45:10,488 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-09 19:45:10,495 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-09 19:45:10,495 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-09 19:45:10,495 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-09 19:45:10,548 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-09 19:45:10,596 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 19:45:10,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-09 19:45:10,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 19:45:10,623 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-09 19:45:10,634 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-09 19:45:10,668 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-09 19:45:10,684 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == salethreadThread1of1ForFork0 ======== [2022-11-09 19:45:10,693 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;@e6fbd16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 19:45:10,693 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-09 19:45:10,779 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2022-11-09 19:45:10,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:45:10,782 INFO L85 PathProgramCache]: Analyzing trace with hash -311906661, now seen corresponding path program 1 times [2022-11-09 19:45:10,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:45:10,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958791496] [2022-11-09 19:45:10,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:45:10,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:45:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 19:45:11,030 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-09 19:45:11,031 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-11-09 19:45:11,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958791496] [2022-11-09 19:45:11,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958791496] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 19:45:11,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 19:45:11,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-09 19:45:11,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129260123] [2022-11-09 19:45:11,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 19:45:11,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-09 19:45:11,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-11-09 19:45:11,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-09 19:45:11,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-09 19:45:11,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:45:11,051 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 19:45:11,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) 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-11-09 19:45:11,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:45:11,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:11,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-09 19:45:11,076 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2022-11-09 19:45:11,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:45:11,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1996792538, now seen corresponding path program 1 times [2022-11-09 19:45:11,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:45:11,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868681853] [2022-11-09 19:45:11,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:45:11,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:45:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 19:45:11,118 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-09 19:45:11,119 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-11-09 19:45:11,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868681853] [2022-11-09 19:45:11,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868681853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 19:45:11,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 19:45:11,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-09 19:45:11,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134890026] [2022-11-09 19:45:11,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 19:45:11,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-09 19:45:11,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-11-09 19:45:11,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-09 19:45:11,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-09 19:45:11,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:45:11,122 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 19:45:11,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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-09 19:45:11,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:11,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:45:11,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:11,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:11,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 4 remaining) [2022-11-09 19:45:11,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 4 remaining) [2022-11-09 19:45:11,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 4 remaining) [2022-11-09 19:45:11,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 4 remaining) [2022-11-09 19:45:11,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-09 19:45:11,347 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-09 19:45:11,348 INFO L307 ceAbstractionStarter]: Result for error location salethreadThread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE (1/2) [2022-11-09 19:45:11,351 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 19:45:11,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-09 19:45:11,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 19:45:11,353 INFO L229 MonitoredProcess]: Starting monitored process 3 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-09 19:45:11,393 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-09 19:45:11,394 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-09 19:45:11,394 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;@e6fbd16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 19:45:11,394 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-09 19:45:11,397 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-09 19:45:11,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:45:11,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1346301244, now seen corresponding path program 1 times [2022-11-09 19:45:11,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:45:11,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523032518] [2022-11-09 19:45:11,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:45:11,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:45:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 19:45:11,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-11-09 19:45:11,427 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-09 19:45:11,428 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-11-09 19:45:11,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523032518] [2022-11-09 19:45:11,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523032518] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 19:45:11,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 19:45:11,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-09 19:45:11,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602209109] [2022-11-09 19:45:11,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 19:45:11,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-09 19:45:11,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-11-09 19:45:11,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-09 19:45:11,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-09 19:45:11,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:45:11,429 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 19:45:11,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 21.0) internal successors, (21), 2 states have internal predecessors, (21), 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-09 19:45:11,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:45:11,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:45:11,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-09 19:45:11,436 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-09 19:45:11,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:45:11,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1828019146, now seen corresponding path program 1 times [2022-11-09 19:45:11,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:45:11,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778923782] [2022-11-09 19:45:11,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:45:11,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:45:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 19:45:11,500 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-09 19:45:11,500 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-11-09 19:45:11,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778923782] [2022-11-09 19:45:11,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778923782] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 19:45:11,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 19:45:11,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-09 19:45:11,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583703391] [2022-11-09 19:45:11,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 19:45:11,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-09 19:45:11,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-11-09 19:45:11,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-09 19:45:11,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-09 19:45:11,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:45:11,502 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 19:45:11,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-09 19:45:11,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:45:11,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:45:11,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:45:11,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:11,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-09 19:45:11,548 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-09 19:45:11,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:45:11,549 INFO L85 PathProgramCache]: Analyzing trace with hash 476543262, now seen corresponding path program 1 times [2022-11-09 19:45:11,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:45:11,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777955738] [2022-11-09 19:45:11,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:45:11,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:45:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 19:45:11,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 19:45:11,636 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-11-09 19:45:11,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777955738] [2022-11-09 19:45:11,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777955738] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 19:45:11,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-09 19:45:11,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2022-11-09 19:45:11,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365449274] [2022-11-09 19:45:11,636 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-09 19:45:11,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-09 19:45:11,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-11-09 19:45:11,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-09 19:45:11,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-09 19:45:11,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:45:11,641 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 19:45:11,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-09 19:45:11,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:45:11,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:11,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:45:11,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:45:11,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:11,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:45:11,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-09 19:45:11,685 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-09 19:45:11,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:45:11,686 INFO L85 PathProgramCache]: Analyzing trace with hash 476877077, now seen corresponding path program 1 times [2022-11-09 19:45:11,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:45:11,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899055452] [2022-11-09 19:45:11,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:45:11,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:45:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-09 19:45:11,702 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-09 19:45:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-09 19:45:11,741 INFO L130 FreeRefinementEngine]: Strategy BADGER found a feasible trace [2022-11-09 19:45:11,742 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-09 19:45:11,742 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2022-11-09 19:45:11,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2022-11-09 19:45:11,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2022-11-09 19:45:11,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2022-11-09 19:45:11,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2022-11-09 19:45:11,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2022-11-09 19:45:11,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-09 19:45:11,749 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-11-09 19:45:11,750 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2022-11-09 19:45:11,750 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-09 19:45:11,750 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-09 19:45:11,772 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-09 19:45:11,778 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 19:45:11,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-09 19:45:11,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 19:45:11,780 INFO L229 MonitoredProcess]: Starting monitored process 4 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-09 19:45:11,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-11-09 19:45:11,790 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-09 19:45:11,791 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == salethreadThread1of2ForFork0 ======== [2022-11-09 19:45:11,791 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;@e6fbd16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 19:45:11,791 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-09 19:45:11,826 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2022-11-09 19:45:11,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:45:11,827 INFO L85 PathProgramCache]: Analyzing trace with hash -441666231, now seen corresponding path program 1 times [2022-11-09 19:45:11,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:45:11,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224649852] [2022-11-09 19:45:11,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:45:11,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:45:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 19:45:11,848 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-09 19:45:11,848 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-11-09 19:45:11,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224649852] [2022-11-09 19:45:11,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224649852] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 19:45:11,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 19:45:11,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-09 19:45:11,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632534636] [2022-11-09 19:45:11,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 19:45:11,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-09 19:45:11,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-11-09 19:45:11,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-09 19:45:11,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-09 19:45:11,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:45:11,850 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 19:45:11,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) 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-11-09 19:45:11,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:45:11,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:11,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-09 19:45:11,867 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2022-11-09 19:45:11,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:45:11,868 INFO L85 PathProgramCache]: Analyzing trace with hash 2101498532, now seen corresponding path program 1 times [2022-11-09 19:45:11,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:45:11,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870649996] [2022-11-09 19:45:11,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:45:11,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:45:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 19:45:11,890 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-09 19:45:11,891 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-11-09 19:45:11,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870649996] [2022-11-09 19:45:11,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870649996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 19:45:11,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 19:45:11,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-09 19:45:11,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011191454] [2022-11-09 19:45:11,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 19:45:11,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-09 19:45:11,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-11-09 19:45:11,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-09 19:45:11,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-09 19:45:11,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:45:11,893 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 19:45:11,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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-09 19:45:11,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:11,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:45:12,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:12,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:12,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-09 19:45:12,219 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2022-11-09 19:45:12,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:45:12,219 INFO L85 PathProgramCache]: Analyzing trace with hash -2063001899, now seen corresponding path program 1 times [2022-11-09 19:45:12,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:45:12,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078526669] [2022-11-09 19:45:12,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:45:12,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:45:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 19:45:12,294 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-09 19:45:12,294 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-11-09 19:45:12,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078526669] [2022-11-09 19:45:12,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078526669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 19:45:12,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 19:45:12,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-09 19:45:12,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480168904] [2022-11-09 19:45:12,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 19:45:12,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-09 19:45:12,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-11-09 19:45:12,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-09 19:45:12,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-09 19:45:12,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:45:12,296 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 19:45:12,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-09 19:45:12,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:12,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:12,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:45:12,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:12,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:12,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:12,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-09 19:45:12,365 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2022-11-09 19:45:12,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:45:12,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1736741071, now seen corresponding path program 1 times [2022-11-09 19:45:12,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:45:12,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394750093] [2022-11-09 19:45:12,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:45:12,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:45:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 19:45:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-09 19:45:12,693 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-11-09 19:45:12,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394750093] [2022-11-09 19:45:12,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394750093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 19:45:12,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 19:45:12,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-09 19:45:12,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16034323] [2022-11-09 19:45:12,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 19:45:12,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 19:45:12,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-11-09 19:45:12,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 19:45:12,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 19:45:12,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:45:12,695 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 19:45:12,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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-09 19:45:12,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:12,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:12,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:12,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:45:12,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:12,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:12,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:12,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:45:12,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-09 19:45:12,784 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2022-11-09 19:45:12,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:45:12,785 INFO L85 PathProgramCache]: Analyzing trace with hash -60210288, now seen corresponding path program 1 times [2022-11-09 19:45:12,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:45:12,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344672472] [2022-11-09 19:45:12,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:45:12,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:45:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 19:45:12,870 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 19:45:12,870 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-11-09 19:45:12,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344672472] [2022-11-09 19:45:12,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344672472] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 19:45:12,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-09 19:45:12,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-11-09 19:45:12,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474234453] [2022-11-09 19:45:12,871 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-09 19:45:12,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-09 19:45:12,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-11-09 19:45:12,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-09 19:45:12,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-09 19:45:12,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:45:12,872 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 19:45:12,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-09 19:45:12,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:12,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:12,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:12,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:45:12,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:45:12,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:12,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:12,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:45:12,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:45:12,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-09 19:45:12,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-09 19:45:12,966 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2022-11-09 19:45:12,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:45:12,967 INFO L85 PathProgramCache]: Analyzing trace with hash 2127484772, now seen corresponding path program 1 times [2022-11-09 19:45:12,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:45:12,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729538421] [2022-11-09 19:45:12,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:45:12,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:45:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-09 19:45:12,980 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-09 19:45:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-09 19:45:13,003 INFO L130 FreeRefinementEngine]: Strategy BADGER found a feasible trace [2022-11-09 19:45:13,003 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-09 19:45:13,003 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (3 of 4 remaining) [2022-11-09 19:45:13,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (2 of 4 remaining) [2022-11-09 19:45:13,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 4 remaining) [2022-11-09 19:45:13,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 4 remaining) [2022-11-09 19:45:13,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-09 19:45:13,004 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-09 19:45:13,005 INFO L307 ceAbstractionStarter]: Result for error location salethreadThread1of2ForFork0 was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/3) [2022-11-09 19:45:13,008 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2022-11-09 19:45:13,008 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-09 19:45:13,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:45:13 BasicIcfg [2022-11-09 19:45:13,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-09 19:45:13,081 INFO L158 Benchmark]: Toolchain (without parser) took 3372.88ms. Allocated memory was 160.4MB in the beginning and 235.9MB in the end (delta: 75.5MB). Free memory was 134.0MB in the beginning and 199.3MB in the end (delta: -65.3MB). Peak memory consumption was 141.8MB. Max. memory is 8.0GB. [2022-11-09 19:45:13,081 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 160.4MB. Free memory was 121.2MB in the beginning and 121.2MB in the end (delta: 64.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-11-09 19:45:13,081 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.52ms. Allocated memory is still 160.4MB. Free memory was 133.8MB in the beginning and 122.1MB in the end (delta: 11.7MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. [2022-11-09 19:45:13,082 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.48ms. Allocated memory is still 160.4MB. Free memory was 122.1MB in the beginning and 120.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-09 19:45:13,082 INFO L158 Benchmark]: Boogie Preprocessor took 43.10ms. Allocated memory is still 160.4MB. Free memory was 120.0MB in the beginning and 118.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-09 19:45:13,082 INFO L158 Benchmark]: RCFGBuilder took 359.59ms. Allocated memory is still 160.4MB. Free memory was 118.2MB in the beginning and 101.8MB in the end (delta: 16.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-11-09 19:45:13,082 INFO L158 Benchmark]: TraceAbstraction took 2616.24ms. Allocated memory was 160.4MB in the beginning and 235.9MB in the end (delta: 75.5MB). Free memory was 100.9MB in the beginning and 199.3MB in the end (delta: -98.5MB). Peak memory consumption was 110.0MB. Max. memory is 8.0GB. [2022-11-09 19:45:13,083 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 160.4MB. Free memory was 121.2MB in the beginning and 121.2MB in the end (delta: 64.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 288.52ms. Allocated memory is still 160.4MB. Free memory was 133.8MB in the beginning and 122.1MB in the end (delta: 11.7MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.48ms. Allocated memory is still 160.4MB. Free memory was 122.1MB in the beginning and 120.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.10ms. Allocated memory is still 160.4MB. Free memory was 120.0MB in the beginning and 118.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 359.59ms. Allocated memory is still 160.4MB. Free memory was 118.2MB in the beginning and 101.8MB in the end (delta: 16.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 2616.24ms. Allocated memory was 160.4MB in the beginning and 235.9MB in the end (delta: 75.5MB). Free memory was 100.9MB in the beginning and 199.3MB in the end (delta: -98.5MB). Peak memory consumption was 110.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1202, positive: 1148, positive conditional: 156, positive unconditional: 992, negative: 54, negative conditional: 39, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1166, positive: 1148, positive conditional: 156, positive unconditional: 992, negative: 18, negative conditional: 3, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1166, positive: 1148, positive conditional: 156, positive unconditional: 992, negative: 18, negative conditional: 3, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1175, positive: 1148, positive conditional: 3, positive unconditional: 1145, negative: 27, negative conditional: 6, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1175, positive: 1148, positive conditional: 3, positive unconditional: 1145, negative: 27, negative conditional: 1, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1175, positive: 1148, positive conditional: 3, positive unconditional: 1145, negative: 27, negative conditional: 1, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 996, positive: 979, positive conditional: 3, positive unconditional: 976, negative: 17, negative conditional: 1, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 996, positive: 959, positive conditional: 0, positive unconditional: 959, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 37, positive: 20, positive conditional: 3, positive unconditional: 17, negative: 17, negative conditional: 1, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 143, positive: 100, positive conditional: 11, positive unconditional: 89, negative: 43, negative conditional: 1, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1175, positive: 169, positive conditional: 0, positive unconditional: 169, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 996, unknown conditional: 4, unknown unconditional: 992] , Statistics on independence cache: Total cache size (in pairs): 996, Positive cache size: 979, Positive conditional cache size: 3, Positive unconditional cache size: 976, Negative cache size: 17, Negative conditional cache size: 1, Negative unconditional cache size: 16, Eliminated conditions: 5, Maximal queried relation: 2, Independence queries for same thread: 36 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 110, Number of trivial persistent sets: 95, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1007, positive: 992, positive conditional: 0, positive unconditional: 992, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1202, positive: 1148, positive conditional: 156, positive unconditional: 992, negative: 54, negative conditional: 39, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1166, positive: 1148, positive conditional: 156, positive unconditional: 992, negative: 18, negative conditional: 3, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1166, positive: 1148, positive conditional: 156, positive unconditional: 992, negative: 18, negative conditional: 3, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1175, positive: 1148, positive conditional: 3, positive unconditional: 1145, negative: 27, negative conditional: 6, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1175, positive: 1148, positive conditional: 3, positive unconditional: 1145, negative: 27, negative conditional: 1, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1175, positive: 1148, positive conditional: 3, positive unconditional: 1145, negative: 27, negative conditional: 1, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 996, positive: 979, positive conditional: 3, positive unconditional: 976, negative: 17, negative conditional: 1, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 996, positive: 959, positive conditional: 0, positive unconditional: 959, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 37, positive: 20, positive conditional: 3, positive unconditional: 17, negative: 17, negative conditional: 1, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 143, positive: 100, positive conditional: 11, positive unconditional: 89, negative: 43, negative conditional: 1, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1175, positive: 169, positive conditional: 0, positive unconditional: 169, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 996, unknown conditional: 4, unknown unconditional: 992] , Statistics on independence cache: Total cache size (in pairs): 996, Positive cache size: 979, Positive conditional cache size: 3, Positive unconditional cache size: 976, Negative cache size: 17, Negative conditional cache size: 1, Negative unconditional cache size: 16, Eliminated conditions: 5, Maximal queried relation: 2, Independence queries for same thread: 36 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 431, positive: 396, positive conditional: 27, positive unconditional: 369, negative: 35, negative conditional: 32, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 399, positive: 396, positive conditional: 27, positive unconditional: 369, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 399, positive: 396, positive conditional: 27, positive unconditional: 369, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 399, positive: 396, positive conditional: 0, positive unconditional: 396, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 399, positive: 396, positive conditional: 0, positive unconditional: 396, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 399, positive: 396, positive conditional: 0, positive unconditional: 396, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 359, positive: 356, positive conditional: 0, positive unconditional: 356, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 359, positive: 353, positive conditional: 0, positive unconditional: 353, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 399, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 359, unknown conditional: 0, unknown unconditional: 359] , Statistics on independence cache: Total cache size (in pairs): 359, Positive cache size: 356, Positive conditional cache size: 0, Positive unconditional cache size: 356, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 32 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 47, Number of trivial persistent sets: 47, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 372, positive: 369, positive conditional: 0, positive unconditional: 369, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 431, positive: 396, positive conditional: 27, positive unconditional: 369, negative: 35, negative conditional: 32, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 399, positive: 396, positive conditional: 27, positive unconditional: 369, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 399, positive: 396, positive conditional: 27, positive unconditional: 369, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 399, positive: 396, positive conditional: 0, positive unconditional: 396, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 399, positive: 396, positive conditional: 0, positive unconditional: 396, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 399, positive: 396, positive conditional: 0, positive unconditional: 396, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 359, positive: 356, positive conditional: 0, positive unconditional: 356, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 359, positive: 353, positive conditional: 0, positive unconditional: 353, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 399, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 359, unknown conditional: 0, unknown unconditional: 359] , Statistics on independence cache: Total cache size (in pairs): 359, Positive cache size: 356, Positive conditional cache size: 0, Positive unconditional cache size: 356, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 32 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 23960, positive: 20735, positive conditional: 16928, positive unconditional: 3807, negative: 3225, negative conditional: 3166, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21491, positive: 20735, positive conditional: 16928, positive unconditional: 3807, negative: 756, negative conditional: 697, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21491, positive: 20735, positive conditional: 16928, positive unconditional: 3807, negative: 756, negative conditional: 697, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23498, positive: 20735, positive conditional: 189, positive unconditional: 20546, negative: 2763, negative conditional: 1818, negative unconditional: 945, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23498, positive: 20735, positive conditional: 189, positive unconditional: 20546, negative: 2763, negative conditional: 178, negative unconditional: 2585, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23498, positive: 20735, positive conditional: 189, positive unconditional: 20546, negative: 2763, negative conditional: 178, negative unconditional: 2585, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3381, positive: 3312, positive conditional: 9, positive unconditional: 3303, negative: 69, negative conditional: 5, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3381, positive: 3229, positive conditional: 0, positive unconditional: 3229, negative: 152, negative conditional: 0, negative unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 152, positive: 83, positive conditional: 9, positive unconditional: 74, negative: 69, negative conditional: 5, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 121, positive: 64, positive conditional: 6, positive unconditional: 58, negative: 57, negative conditional: 4, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 23498, positive: 17423, positive conditional: 180, positive unconditional: 17243, negative: 2694, negative conditional: 173, negative unconditional: 2521, unknown: 3381, unknown conditional: 14, unknown unconditional: 3367] , Statistics on independence cache: Total cache size (in pairs): 3381, Positive cache size: 3312, Positive conditional cache size: 9, Positive unconditional cache size: 3303, Negative cache size: 69, Negative conditional cache size: 5, Negative unconditional cache size: 64, Eliminated conditions: 1640, Maximal queried relation: 4, Independence queries for same thread: 2469 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 1409, Number of trivial persistent sets: 943, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3866, positive: 3807, positive conditional: 0, positive unconditional: 3807, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 23960, positive: 20735, positive conditional: 16928, positive unconditional: 3807, negative: 3225, negative conditional: 3166, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21491, positive: 20735, positive conditional: 16928, positive unconditional: 3807, negative: 756, negative conditional: 697, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21491, positive: 20735, positive conditional: 16928, positive unconditional: 3807, negative: 756, negative conditional: 697, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23498, positive: 20735, positive conditional: 189, positive unconditional: 20546, negative: 2763, negative conditional: 1818, negative unconditional: 945, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23498, positive: 20735, positive conditional: 189, positive unconditional: 20546, negative: 2763, negative conditional: 178, negative unconditional: 2585, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23498, positive: 20735, positive conditional: 189, positive unconditional: 20546, negative: 2763, negative conditional: 178, negative unconditional: 2585, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3381, positive: 3312, positive conditional: 9, positive unconditional: 3303, negative: 69, negative conditional: 5, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3381, positive: 3229, positive conditional: 0, positive unconditional: 3229, negative: 152, negative conditional: 0, negative unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 152, positive: 83, positive conditional: 9, positive unconditional: 74, negative: 69, negative conditional: 5, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 121, positive: 64, positive conditional: 6, positive unconditional: 58, negative: 57, negative conditional: 4, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 23498, positive: 17423, positive conditional: 180, positive unconditional: 17243, negative: 2694, negative conditional: 173, negative unconditional: 2521, unknown: 3381, unknown conditional: 14, unknown unconditional: 3367] , Statistics on independence cache: Total cache size (in pairs): 3381, Positive cache size: 3312, Positive conditional cache size: 9, Positive unconditional cache size: 3303, Negative cache size: 69, Negative conditional cache size: 5, Negative unconditional cache size: 64, Eliminated conditions: 1640, Maximal queried relation: 4, Independence queries for same thread: 2469 - DataRaceFoundResult [Line: 722]: Data race detected Data race detected The following path leads to a data race: [L717] 0 int numberOfSeatsSold; VAL [numberOfSeatsSold=0] [L718] 0 int stopSales; VAL [numberOfSeatsSold=0, stopSales=0] [L719] 0 int numOfTickets; VAL [numberOfSeatsSold=0, numOfTickets=0, stopSales=0] [L736] 0 pthread_t salethreads[5]; VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, numberOfSeatsSold=0, numOfTickets=0, salethreads={3:0}, stopSales=0] [L738] 0 numOfTickets = 5 VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, numberOfSeatsSold=0, numOfTickets=5, salethreads={3:0}, stopSales=0] [L741] 0 numberOfSeatsSold = 0 VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, numberOfSeatsSold=0, numOfTickets=5, salethreads={3:0}, stopSales=0] [L744] 0 stopSales = 0 VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, numberOfSeatsSold=0, numOfTickets=5, salethreads={3:0}, stopSales=0] [L746] 0 int i = 0; VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, i=0, numberOfSeatsSold=0, numOfTickets=5, salethreads={3:0}, stopSales=0] [L746] COND TRUE 0 i < 5 VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, i=0, numberOfSeatsSold=0, numOfTickets=5, salethreads={3:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(argc)=49, arg={0:0}, argc=49, argv={50:51}, argv={50:51}, i=0, numberOfSeatsSold=0, numOfTickets=5, pthread_create(&salethreads[i], 0, salethread, ((void *)0))=-2, salethreads={3:0}, stopSales=0] [L721] 1 !stopSales VAL [arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=5, stopSales=0] [L721] COND TRUE 1 !stopSales VAL [arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=5, stopSales=0] [L722] 1 int _numberOfSeatsSold = numberOfSeatsSold; VAL [arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=5, stopSales=0] [L746] 0 i++ VAL [\old(argc)=49, arg={0:0}, arg={0:0}, argc=49, argv={50:51}, argv={50:51}, i=1, numberOfSeatsSold=0, numOfTickets=5, salethreads={3:0}, stopSales=0] [L746] COND TRUE 0 i < 5 VAL [\old(argc)=49, arg={0:0}, arg={0:0}, argc=49, argv={50:51}, argv={50:51}, i=1, numberOfSeatsSold=0, numOfTickets=5, salethreads={3:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(argc)=49, arg={0:0}, arg={0:0}, argc=49, argv={50:51}, argv={50:51}, i=1, numberOfSeatsSold=0, numOfTickets=5, pthread_create(&salethreads[i], 0, salethread, ((void *)0))=-1, salethreads={3:0}, stopSales=0] [L746] 0 i++ VAL [\old(argc)=49, arg={0:0}, arg={0:0}, argc=49, argv={50:51}, argv={50:51}, i=2, numberOfSeatsSold=0, numOfTickets=5, salethreads={3:0}, stopSales=0] [L746] COND TRUE 0 i < 5 VAL [\old(argc)=49, arg={0:0}, arg={0:0}, argc=49, argv={50:51}, argv={50:51}, i=2, numberOfSeatsSold=0, numOfTickets=5, salethreads={3:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(argc)=49, arg={0:0}, arg={0:0}, argc=49, argv={50:51}, argv={50:51}, i=2, numberOfSeatsSold=0, numOfTickets=5, pthread_create(&salethreads[i], 0, salethread, ((void *)0))=0, salethreads={3:0}, stopSales=0] [L721] 2 !stopSales VAL [arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=5, stopSales=0] [L721] COND TRUE 2 !stopSales VAL [arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=5, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=5, stopSales=0] [L723] COND FALSE 2 !(_numberOfSeatsSold >= (5 - (((5 / 10) == 0) ? 1 : (5 / 10)))) VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=5, stopSales=0] [L729] 2 numberOfSeatsSold = _numberOfSeatsSold + 1 VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=1, numOfTickets=5, stopSales=0] [L722] 1 int _numberOfSeatsSold = numberOfSeatsSold; VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=1, numOfTickets=5, stopSales=0] Now there is a data race on ~numberOfSeatsSold~0 between C: numberOfSeatsSold = _numberOfSeatsSold + 1 [729] and C: int _numberOfSeatsSold = numberOfSeatsSold; [722] - UnprovableResult [Line: 721]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: salethreadThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 100 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, 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: 6, 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.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 67 NumberOfCodeBlocks, 67 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 69 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 3 procedures, 100 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, 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: 11, 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.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 110 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 0/1 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: salethreadThread1of2ForFork0 with 1 thread instances CFG has 4 procedures, 117 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.6s, 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: 24, 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.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 339 NumberOfCodeBlocks, 339 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 270 ConstructedInterpolants, 0 QuantifiedInterpolants, 443 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 24/36 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-09 19:45:13,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2022-11-09 19:45:13,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2022-11-09 19:45:13,573 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-09 19:45:13,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...