/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.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps X --traceabstraction.defines.what.statements.are.considered.a.step.in.por LOOP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 19:48:51,882 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 19:48:51,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 19:48:51,914 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 19:48:51,914 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 19:48:51,917 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 19:48:51,919 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 19:48:51,922 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 19:48:51,923 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 19:48:51,927 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 19:48:51,927 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 19:48:51,929 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 19:48:51,929 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 19:48:51,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 19:48:51,931 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 19:48:51,932 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 19:48:51,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 19:48:51,933 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 19:48:51,934 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 19:48:51,938 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 19:48:51,939 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 19:48:51,940 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 19:48:51,941 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 19:48:51,941 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 19:48:51,946 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 19:48:51,946 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 19:48:51,946 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 19:48:51,947 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 19:48:51,947 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 19:48:51,948 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 19:48:51,948 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 19:48:51,948 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 19:48:51,950 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 19:48:51,950 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 19:48:51,951 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 19:48:51,951 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 19:48:51,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 19:48:51,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 19:48:51,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 19:48:51,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 19:48:51,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 19:48:51,953 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 19:48:51,975 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 19:48:51,975 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 19:48:51,975 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 19:48:51,975 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 19:48:51,976 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 19:48:51,976 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 19:48:51,976 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 19:48:51,976 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 19:48:51,977 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 19:48:51,977 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 19:48:51,977 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 19:48:51,977 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 19:48:51,977 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 19:48:51,978 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 19:48:51,978 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 19:48:51,978 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 19:48:51,978 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 19:48:51,978 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 19:48:51,978 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 19:48:51,978 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 19:48:51,978 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 19:48:51,978 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 19:48:51,978 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 19:48:51,979 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 19:48:51,979 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 19:48:51,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 19:48:51,979 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 19:48:51,979 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 19:48:51,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 19:48:51,980 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 19:48:51,980 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 19:48:51,980 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 19:48:51,980 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 19:48:51,980 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 19:48:51,980 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 19:48:51,980 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 19:48:51,980 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: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> X Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> LOOP [2023-05-04 19:48:52,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 19:48:52,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 19:48:52,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 19:48:52,193 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 19:48:52,196 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 19:48:52,197 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2023-05-04 19:48:52,249 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f663f01ad/ac54341b7723467e8fa03428b47ea19e/FLAG17f75422c [2023-05-04 19:48:52,728 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 19:48:52,729 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2023-05-04 19:48:52,746 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f663f01ad/ac54341b7723467e8fa03428b47ea19e/FLAG17f75422c [2023-05-04 19:48:53,228 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f663f01ad/ac54341b7723467e8fa03428b47ea19e [2023-05-04 19:48:53,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 19:48:53,231 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 19:48:53,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 19:48:53,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 19:48:53,237 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 19:48:53,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 07:48:53" (1/1) ... [2023-05-04 19:48:53,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2386e158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:48:53, skipping insertion in model container [2023-05-04 19:48:53,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 07:48:53" (1/1) ... [2023-05-04 19:48:53,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 19:48:53,271 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 19:48:53,387 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-05-04 19:48:53,684 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_2-container_of.i[75002,75015] [2023-05-04 19:48:53,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 19:48:53,717 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 19:48:53,725 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-05-04 19:48:53,756 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_2-container_of.i[75002,75015] [2023-05-04 19:48:53,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 19:48:53,846 INFO L208 MainTranslator]: Completed translation [2023-05-04 19:48:53,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:48:53 WrapperNode [2023-05-04 19:48:53,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 19:48:53,848 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 19:48:53,848 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 19:48:53,848 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 19:48:53,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:48:53" (1/1) ... [2023-05-04 19:48:53,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:48:53" (1/1) ... [2023-05-04 19:48:53,904 INFO L138 Inliner]: procedures = 468, calls = 48, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 115 [2023-05-04 19:48:53,904 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 19:48:53,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 19:48:53,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 19:48:53,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 19:48:53,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:48:53" (1/1) ... [2023-05-04 19:48:53,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:48:53" (1/1) ... [2023-05-04 19:48:53,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:48:53" (1/1) ... [2023-05-04 19:48:53,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:48:53" (1/1) ... [2023-05-04 19:48:53,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:48:53" (1/1) ... [2023-05-04 19:48:53,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:48:53" (1/1) ... [2023-05-04 19:48:53,933 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:48:53" (1/1) ... [2023-05-04 19:48:53,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:48:53" (1/1) ... [2023-05-04 19:48:53,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 19:48:53,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 19:48:53,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 19:48:53,939 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 19:48:53,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:48:53" (1/1) ... [2023-05-04 19:48:53,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 19:48:53,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:48:53,964 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) [2023-05-04 19:48:53,971 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 [2023-05-04 19:48:54,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-05-04 19:48:54,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 19:48:54,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-05-04 19:48:54,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 19:48:54,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 19:48:54,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-05-04 19:48:54,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 19:48:54,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 19:48:54,004 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2023-05-04 19:48:54,004 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2023-05-04 19:48:54,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 19:48:54,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 19:48:54,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 19:48:54,006 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 19:48:54,230 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 19:48:54,231 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 19:48:54,407 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 19:48:54,422 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 19:48:54,423 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-05-04 19:48:54,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 07:48:54 BoogieIcfgContainer [2023-05-04 19:48:54,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 19:48:54,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 19:48:54,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 19:48:54,430 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 19:48:54,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 07:48:53" (1/3) ... [2023-05-04 19:48:54,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae96b10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 07:48:54, skipping insertion in model container [2023-05-04 19:48:54,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:48:53" (2/3) ... [2023-05-04 19:48:54,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae96b10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 07:48:54, skipping insertion in model container [2023-05-04 19:48:54,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 07:48:54" (3/3) ... [2023-05-04 19:48:54,435 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2023-05-04 19:48:54,440 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 19:48:54,447 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 19:48:54,448 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-05-04 19:48:54,448 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 19:48:54,511 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-04 19:48:54,554 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 19:48:54,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 19:48:54,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:48:54,556 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) [2023-05-04 19:48:54,561 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 [2023-05-04 19:48:54,593 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 19:48:54,610 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 19:48:54,614 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;@5ea79ba8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 19:48:54,615 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-05-04 19:48:54,643 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-04 19:48:54,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:48:54,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1084366875, now seen corresponding path program 1 times [2023-05-04 19:48:54,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:48:54,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86221098] [2023-05-04 19:48:54,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:48:54,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:48:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:48:55,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:48:55,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:48:55,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86221098] [2023-05-04 19:48:55,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86221098] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:48:55,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:48:55,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-05-04 19:48:55,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390291915] [2023-05-04 19:48:55,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:48:55,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-05-04 19:48:55,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:48:55,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-05-04 19:48:55,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-05-04 19:48:55,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:48:55,324 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:48:55,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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) [2023-05-04 19:48:55,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:48:55,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:48:55,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 19:48:55,458 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-04 19:48:55,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:48:55,459 INFO L85 PathProgramCache]: Analyzing trace with hash 234520064, now seen corresponding path program 1 times [2023-05-04 19:48:55,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:48:55,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636628008] [2023-05-04 19:48:55,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:48:55,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:48:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:48:55,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:48:55,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:48:55,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636628008] [2023-05-04 19:48:55,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636628008] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:48:55,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:48:55,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-05-04 19:48:55,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327348381] [2023-05-04 19:48:55,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:48:55,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-05-04 19:48:55,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:48:55,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-05-04 19:48:55,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-05-04 19:48:55,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:48:55,778 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:48:55,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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) [2023-05-04 19:48:55,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:48:55,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:49:02,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:49:02,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:49:02,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 19:49:02,514 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-04 19:49:02,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:49:02,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1240692526, now seen corresponding path program 1 times [2023-05-04 19:49:02,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:49:02,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313203636] [2023-05-04 19:49:02,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:49:02,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:49:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:49:04,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:49:04,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:49:04,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313203636] [2023-05-04 19:49:04,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313203636] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:49:04,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:49:04,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-05-04 19:49:04,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014558666] [2023-05-04 19:49:04,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:49:04,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-05-04 19:49:04,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:49:04,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-05-04 19:49:04,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2023-05-04 19:49:04,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:49:04,008 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:49:04,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.3) internal successors, (106), 20 states have internal predecessors, (106), 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) [2023-05-04 19:49:04,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:49:04,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:49:04,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:49:05,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:49:05,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:49:05,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-05-04 19:49:05,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-04 19:49:05,039 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-04 19:49:05,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:49:05,040 INFO L85 PathProgramCache]: Analyzing trace with hash -248679740, now seen corresponding path program 1 times [2023-05-04 19:49:05,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:49:05,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104649729] [2023-05-04 19:49:05,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:49:05,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:49:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:49:07,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:49:07,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:49:07,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104649729] [2023-05-04 19:49:07,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104649729] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:49:07,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:49:07,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2023-05-04 19:49:07,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366189771] [2023-05-04 19:49:07,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:49:07,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-05-04 19:49:07,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:49:07,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-05-04 19:49:07,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2023-05-04 19:49:07,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:49:07,913 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:49:07,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.5625) internal successors, (114), 32 states have internal predecessors, (114), 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) [2023-05-04 19:49:07,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:49:07,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:49:07,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-05-04 19:49:07,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:49:20,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-05-04 19:49:20,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:49:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 19:49:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-05-04 19:49:20,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-04 19:49:20,736 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-04 19:49:20,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:49:20,737 INFO L85 PathProgramCache]: Analyzing trace with hash -856293138, now seen corresponding path program 2 times [2023-05-04 19:49:20,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:49:20,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078956824] [2023-05-04 19:49:20,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:49:20,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:49:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:49:22,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:49:22,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:49:22,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078956824] [2023-05-04 19:49:22,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078956824] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:49:22,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:49:22,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2023-05-04 19:49:22,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748600471] [2023-05-04 19:49:22,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:49:22,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-05-04 19:49:22,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:49:22,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-05-04 19:49:22,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2023-05-04 19:49:22,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:49:22,612 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:49:22,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 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) [2023-05-04 19:49:22,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-05-04 19:49:22,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:49:22,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 19:49:22,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-05-04 19:49:22,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:49:26,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-05-04 19:49:26,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:49:26,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 19:49:26,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-05-04 19:49:26,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 19:49:26,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-04 19:49:26,225 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-04 19:49:26,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:49:26,226 INFO L85 PathProgramCache]: Analyzing trace with hash 619330692, now seen corresponding path program 2 times [2023-05-04 19:49:26,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:49:26,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426457459] [2023-05-04 19:49:26,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:49:26,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:49:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:49:28,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:49:28,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:49:28,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426457459] [2023-05-04 19:49:28,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426457459] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:49:28,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:49:28,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2023-05-04 19:49:28,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109423820] [2023-05-04 19:49:28,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:49:28,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-05-04 19:49:28,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:49:28,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-05-04 19:49:28,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2023-05-04 19:49:28,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:49:28,387 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:49:28,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.5625) internal successors, (114), 32 states have internal predecessors, (114), 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) [2023-05-04 19:49:28,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-05-04 19:49:28,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:49:28,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 19:49:28,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-05-04 19:49:28,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 19:49:28,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:49:40,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-05-04 19:49:40,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:49:40,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 19:49:40,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-05-04 19:49:40,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 19:49:40,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-05-04 19:49:40,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-05-04 19:49:40,522 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-04 19:49:40,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:49:40,523 INFO L85 PathProgramCache]: Analyzing trace with hash -562114270, now seen corresponding path program 3 times [2023-05-04 19:49:40,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:49:40,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540711387] [2023-05-04 19:49:40,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:49:40,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:49:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 19:49:40,560 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-04 19:49:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 19:49:40,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-04 19:49:40,643 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-04 19:49:40,646 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-05-04 19:49:40,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-05-04 19:49:40,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-05-04 19:49:40,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-05-04 19:49:40,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-05-04 19:49:40,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2023-05-04 19:49:40,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-05-04 19:49:40,660 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2023-05-04 19:49:40,663 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 19:49:40,664 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 19:49:40,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 07:49:40 BasicIcfg [2023-05-04 19:49:40,743 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 19:49:40,743 INFO L158 Benchmark]: Toolchain (without parser) took 47512.18ms. Allocated memory was 188.7MB in the beginning and 529.5MB in the end (delta: 340.8MB). Free memory was 153.4MB in the beginning and 427.9MB in the end (delta: -274.5MB). Peak memory consumption was 66.9MB. Max. memory is 8.0GB. [2023-05-04 19:49:40,743 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 188.7MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 19:49:40,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 611.46ms. Allocated memory was 188.7MB in the beginning and 282.1MB in the end (delta: 93.3MB). Free memory was 153.1MB in the beginning and 207.8MB in the end (delta: -54.7MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2023-05-04 19:49:40,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.72ms. Allocated memory is still 282.1MB. Free memory was 207.8MB in the beginning and 204.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-04 19:49:40,744 INFO L158 Benchmark]: Boogie Preprocessor took 33.68ms. Allocated memory is still 282.1MB. Free memory was 204.6MB in the beginning and 202.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 19:49:40,744 INFO L158 Benchmark]: RCFGBuilder took 485.48ms. Allocated memory is still 282.1MB. Free memory was 202.0MB in the beginning and 178.4MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-05-04 19:49:40,744 INFO L158 Benchmark]: TraceAbstraction took 46316.58ms. Allocated memory was 282.1MB in the beginning and 529.5MB in the end (delta: 247.5MB). Free memory was 177.4MB in the beginning and 427.9MB in the end (delta: -250.5MB). There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 19:49:40,745 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.12ms. Allocated memory is still 188.7MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 611.46ms. Allocated memory was 188.7MB in the beginning and 282.1MB in the end (delta: 93.3MB). Free memory was 153.1MB in the beginning and 207.8MB in the end (delta: -54.7MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.72ms. Allocated memory is still 282.1MB. Free memory was 207.8MB in the beginning and 204.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.68ms. Allocated memory is still 282.1MB. Free memory was 204.6MB in the beginning and 202.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 485.48ms. Allocated memory is still 282.1MB. Free memory was 202.0MB in the beginning and 178.4MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 46316.58ms. Allocated memory was 282.1MB in the beginning and 529.5MB in the end (delta: 247.5MB). Free memory was 177.4MB in the beginning and 427.9MB in the end (delta: -250.5MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2574, independent: 1475, independent conditional: 500, independent unconditional: 975, dependent: 1081, dependent conditional: 1062, dependent unconditional: 19, unknown: 18, unknown conditional: 4, unknown unconditional: 14] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1515, independent: 1475, independent conditional: 500, independent unconditional: 975, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 18, unknown conditional: 4, unknown unconditional: 14] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1515, independent: 1475, independent conditional: 500, independent unconditional: 975, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 18, unknown conditional: 4, unknown unconditional: 14] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1561, independent: 1475, independent conditional: 22, independent unconditional: 1453, dependent: 47, dependent conditional: 11, dependent unconditional: 36, unknown: 39, unknown conditional: 13, unknown unconditional: 26] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1561, independent: 1475, independent conditional: 22, independent unconditional: 1453, dependent: 47, dependent conditional: 11, dependent unconditional: 36, unknown: 39, unknown conditional: 13, unknown unconditional: 26] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1561, independent: 1475, independent conditional: 22, independent unconditional: 1453, dependent: 47, dependent conditional: 11, dependent unconditional: 36, unknown: 39, unknown conditional: 13, unknown unconditional: 26] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1042, independent: 995, independent conditional: 20, independent unconditional: 975, dependent: 25, dependent conditional: 6, dependent unconditional: 19, unknown: 22, unknown conditional: 8, unknown unconditional: 14] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1042, independent: 974, independent conditional: 0, independent unconditional: 974, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 68, independent: 21, independent conditional: 20, independent unconditional: 1, dependent: 25, dependent conditional: 6, dependent unconditional: 19, unknown: 22, unknown conditional: 8, unknown unconditional: 14] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 21, independent conditional: 20, independent unconditional: 1, dependent: 25, dependent conditional: 6, dependent unconditional: 19, unknown: 22, unknown conditional: 8, unknown unconditional: 14] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24071, independent: 281, independent conditional: 245, independent unconditional: 35, dependent: 340, dependent conditional: 98, dependent unconditional: 243, unknown: 23450, unknown conditional: 8503, unknown unconditional: 14947] , Protected Queries: 0 ], Cache Queries: [ total: 1561, independent: 480, independent conditional: 2, independent unconditional: 478, dependent: 22, dependent conditional: 5, dependent unconditional: 17, unknown: 1059, unknown conditional: 39, unknown unconditional: 1020] , Statistics on independence cache: Total cache size (in pairs): 1020, Positive cache size: 995, Positive conditional cache size: 20, Positive unconditional cache size: 975, Negative cache size: 25, Negative conditional cache size: 6, Negative unconditional cache size: 19, Unknown cache size: 22, Unknown conditional cache size: 8, Unknown unconditional cache size: 14, Eliminated conditions: 0, Maximal queried relation: 4, Independence queries for same thread: 1059 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 15.3s, Number of persistent set computation: 204, Number of trivial persistent sets: 190, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1008, independent: 975, independent conditional: 0, independent unconditional: 975, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2574, independent: 1475, independent conditional: 500, independent unconditional: 975, dependent: 1081, dependent conditional: 1062, dependent unconditional: 19, unknown: 18, unknown conditional: 4, unknown unconditional: 14] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1515, independent: 1475, independent conditional: 500, independent unconditional: 975, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 18, unknown conditional: 4, unknown unconditional: 14] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1515, independent: 1475, independent conditional: 500, independent unconditional: 975, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 18, unknown conditional: 4, unknown unconditional: 14] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1561, independent: 1475, independent conditional: 22, independent unconditional: 1453, dependent: 47, dependent conditional: 11, dependent unconditional: 36, unknown: 39, unknown conditional: 13, unknown unconditional: 26] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1561, independent: 1475, independent conditional: 22, independent unconditional: 1453, dependent: 47, dependent conditional: 11, dependent unconditional: 36, unknown: 39, unknown conditional: 13, unknown unconditional: 26] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1561, independent: 1475, independent conditional: 22, independent unconditional: 1453, dependent: 47, dependent conditional: 11, dependent unconditional: 36, unknown: 39, unknown conditional: 13, unknown unconditional: 26] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1042, independent: 995, independent conditional: 20, independent unconditional: 975, dependent: 25, dependent conditional: 6, dependent unconditional: 19, unknown: 22, unknown conditional: 8, unknown unconditional: 14] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1042, independent: 974, independent conditional: 0, independent unconditional: 974, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 68, independent: 21, independent conditional: 20, independent unconditional: 1, dependent: 25, dependent conditional: 6, dependent unconditional: 19, unknown: 22, unknown conditional: 8, unknown unconditional: 14] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 21, independent conditional: 20, independent unconditional: 1, dependent: 25, dependent conditional: 6, dependent unconditional: 19, unknown: 22, unknown conditional: 8, unknown unconditional: 14] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24071, independent: 281, independent conditional: 245, independent unconditional: 35, dependent: 340, dependent conditional: 98, dependent unconditional: 243, unknown: 23450, unknown conditional: 8503, unknown unconditional: 14947] , Protected Queries: 0 ], Cache Queries: [ total: 1561, independent: 480, independent conditional: 2, independent unconditional: 478, dependent: 22, dependent conditional: 5, dependent unconditional: 17, unknown: 1059, unknown conditional: 39, unknown unconditional: 1020] , Statistics on independence cache: Total cache size (in pairs): 1020, Positive cache size: 995, Positive conditional cache size: 20, Positive unconditional cache size: 975, Negative cache size: 25, Negative conditional cache size: 6, Negative unconditional cache size: 19, Unknown cache size: 22, Unknown conditional cache size: 8, Unknown unconditional cache size: 14, Eliminated conditions: 0, Maximal queried relation: 4, Independence queries for same thread: 1059 - CounterExampleResult [Line: 1675]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1676] 0 pthread_t t1,t2; VAL [t1={3:0}, t2={4:0}] [L1731] CALL, EXPR 0 my_drv_init() [L1725] 0 return 0; VAL [\result=0, t1={3:0}, t2={4:0}] [L1731] RET, EXPR 0 my_drv_init() [L1731] 0 int ret = my_drv_init(); VAL [my_drv_init()=0, ret=0, t1={3:0}, t2={4:0}] [L1732] COND TRUE 0 ret==0 VAL [ret=0, t1={3:0}, t2={4:0}] [L1733] 0 int probe_ret; VAL [ret=0, t1={3:0}, t2={4:0}] [L1734] 0 struct my_data data; VAL [data={5:0}, ret=0, t1={3:0}, t2={4:0}] [L1735] CALL, EXPR 0 my_drv_probe(&data) [L1704] 0 struct device *d = &data->dev; VAL [d={5:24}, data={5:0}, data={5:0}, t1={3:0}, t2={4:0}] [L1706] 0 data->shared.a = 0 VAL [d={5:24}, data={5:0}, data={5:0}, t1={3:0}, t2={4:0}] [L1707] 0 data->shared.b = 0 VAL [d={5:24}, data={5:0}, data={5:0}, t1={3:0}, t2={4:0}] [L1708] 0 int res = __VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=0, d={5:24}, data={5:0}, data={5:0}, res=0, t1={3:0}, t2={4:0}] [L1709] COND FALSE 0 !(\read(res)) VAL [d={5:24}, data={5:0}, data={5:0}, res=0, t1={3:0}, t2={4:0}] [L1711] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={5:24}, d={5:24}, data={5:0}, data={5:0}, pthread_create(&t1, ((void *)0), my_callback, (void *)d)=-1, res=0, t1={3:0}, t2={4:0}] [L1712] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [arg={5:24}, d={5:24}, data={5:0}, data={5:0}, pthread_create(&t2, ((void *)0), my_callback, (void *)d)=0, res=0, t1={3:0}, t2={4:0}] [L1713] 0 return 0; VAL [\result=0, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, res=0, t1={3:0}, t2={4:0}] [L1735] RET, EXPR 0 my_drv_probe(&data) [L1735] 0 probe_ret = my_drv_probe(&data) VAL [arg={5:24}, data={5:0}, my_drv_probe(&data)=0, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1736] COND TRUE 0 probe_ret==0 VAL [arg={5:24}, data={5:0}, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1737] CALL 0 my_drv_disconnect(&data) [L1719] 0 void *status; VAL [arg={5:24}, data={5:0}, data={5:0}, status={7:0}, t1={3:0}, t2={4:0}] [L1720] 0 \read(t1) VAL [\read(t1)=-1, arg={5:24}, data={5:0}, data={5:0}, status={7:0}, t1={3:0}, t2={4:0}] [L1689] 1 struct device *dev = (struct device*)arg; VAL [arg={5:24}, arg={5:24}, dev={5:24}, t1={3:0}, t2={4:0}] [L1690] 1 struct my_data *data; VAL [arg={5:24}, arg={5:24}, dev={5:24}, t1={3:0}, t2={4:0}] [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, dev={5:24}, t1={3:0}, t2={4:0}] [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1={3:0}, t2={4:0}] [L1693] 1 data->shared.a = 1 VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1={3:0}, t2={4:0}] [L1696] EXPR 1 data->shared.b [L1696] 1 int lb = data->shared.b; [L1689] 2 struct device *dev = (struct device*)arg; VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1={3:0}, t2={4:0}] [L1690] 2 struct my_data *data; VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1={3:0}, t2={4:0}] [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1={3:0}, t2={4:0}] [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1={3:0}, t2={4:0}] [L1693] 2 data->shared.a = 1 VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1={3:0}, t2={4:0}] [L1696] EXPR 2 data->shared.b [L1696] 2 int lb = data->shared.b; [L1699] 1 data->shared.b = lb + 1 VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1={3:0}, t2={4:0}] [L1701] 1 return 0; VAL [\result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1={3:0}, t2={4:0}] [L1720] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\read(t1)=-1, \result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, lb=0, pthread_join(t1, &status)={0:0}, status={7:0}, t1={3:0}, t2={4:0}] [L1721] 0 \read(t2) VAL [\read(t2)=0, \result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={7:0}, t1={3:0}, t2={4:0}] [L1699] 2 data->shared.b = lb + 1 VAL [\result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1={3:0}, t2={4:0}] [L1701] 2 return 0; VAL [\result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1={3:0}, t2={4:0}] [L1721] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\read(t2)=0, \result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, lb=0, pthread_join(t2, &status)={0:0}, status={7:0}, t1={3:0}, t2={4:0}] [L1737] RET 0 my_drv_disconnect(&data) [L1738] EXPR 0 data.shared.a VAL [\result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, data={5:0}, data.shared.a=1, dev={5:24}, lb=0, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1738] CALL 0 ldv_assert(data.shared.a==1) [L1675] COND FALSE 0 !(!expression) VAL [\old(expression)=1, \result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, expression=1, lb=0, t1={3:0}, t2={4:0}] [L1738] RET 0 ldv_assert(data.shared.a==1) [L1739] EXPR 0 data.shared.b VAL [\result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, data={5:0}, data.shared.b=1, dev={5:24}, lb=0, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1739] CALL 0 ldv_assert(data.shared.b==2) [L1675] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, expression=0, lb=0, t1={3:0}, t2={4:0}] [L1675] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, expression=0, lb=0, t1={3:0}, t2={4:0}] - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1712]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1711]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 4 procedures, 170 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 46.1s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 36.5s, 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: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 682 NumberOfCodeBlocks, 682 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 562 ConstructedInterpolants, 0 QuantifiedInterpolants, 8428 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-05-04 19:49:40,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2023-05-04 19:49:40,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...