/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -s ../../../trunk/examples/settings/gemcutter/SleepMap-ConcreteSmt-VarAbsGlobalSmt.epf -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-divine/one_time_barrier_twice_2t.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dpor-95ec559 [2023-01-11 18:46:02,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-11 18:46:02,306 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-11 18:46:02,343 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-11 18:46:02,343 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-11 18:46:02,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-11 18:46:02,350 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-11 18:46:02,352 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-11 18:46:02,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-11 18:46:02,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-11 18:46:02,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-11 18:46:02,364 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-11 18:46:02,364 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-11 18:46:02,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-11 18:46:02,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-11 18:46:02,367 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-11 18:46:02,368 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-11 18:46:02,368 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-11 18:46:02,369 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-11 18:46:02,370 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-11 18:46:02,371 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-11 18:46:02,372 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-11 18:46:02,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-11 18:46:02,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-11 18:46:02,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-11 18:46:02,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-11 18:46:02,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-11 18:46:02,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-11 18:46:02,378 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-11 18:46:02,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-11 18:46:02,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-11 18:46:02,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-11 18:46:02,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-11 18:46:02,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-11 18:46:02,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-11 18:46:02,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-11 18:46:02,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-11 18:46:02,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-11 18:46:02,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-11 18:46:02,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-11 18:46:02,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-11 18:46:02,384 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/SleepMap-ConcreteSmt-VarAbsGlobalSmt.epf [2023-01-11 18:46:02,411 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-11 18:46:02,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-11 18:46:02,411 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-01-11 18:46:02,412 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-01-11 18:46:02,412 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-11 18:46:02,412 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-11 18:46:02,413 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-11 18:46:02,413 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-11 18:46:02,413 INFO L138 SettingsManager]: * Use SBE=true [2023-01-11 18:46:02,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-11 18:46:02,413 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-11 18:46:02,413 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-11 18:46:02,413 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-11 18:46:02,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-11 18:46:02,414 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-11 18:46:02,414 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-11 18:46:02,414 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-11 18:46:02,414 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-11 18:46:02,414 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-11 18:46:02,414 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-11 18:46:02,414 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-11 18:46:02,414 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-11 18:46:02,414 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-11 18:46:02,414 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-11 18:46:02,415 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-11 18:46:02,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-11 18:46:02,415 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-11 18:46:02,415 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-11 18:46:02,415 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-11 18:46:02,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-11 18:46:02,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-11 18:46:02,415 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-01-11 18:46:02,415 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-01-11 18:46:02,415 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-01-11 18:46:02,415 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-01-11 18:46:02,415 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2023-01-11 18:46:02,416 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2023-01-11 18:46:02,416 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-11 18:46:02,416 INFO L138 SettingsManager]: * Number of independence relations to use for POR=2 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_ERROR_LOCATION 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 [2023-01-11 18:46:02,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-11 18:46:02,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-11 18:46:02,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-11 18:46:02,647 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-11 18:46:02,648 INFO L275 PluginConnector]: CDTParser initialized [2023-01-11 18:46:02,649 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i [2023-01-11 18:46:03,788 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-11 18:46:03,982 INFO L351 CDTParser]: Found 1 translation units. [2023-01-11 18:46:03,982 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i [2023-01-11 18:46:03,993 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bac3d30bb/7486b548b72645bd83812e0169d86fce/FLAG11b1185f6 [2023-01-11 18:46:04,003 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bac3d30bb/7486b548b72645bd83812e0169d86fce [2023-01-11 18:46:04,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-11 18:46:04,007 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-11 18:46:04,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-11 18:46:04,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-11 18:46:04,010 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-11 18:46:04,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 06:46:04" (1/1) ... [2023-01-11 18:46:04,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f672688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:46:04, skipping insertion in model container [2023-01-11 18:46:04,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 06:46:04" (1/1) ... [2023-01-11 18:46:04,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-11 18:46:04,057 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-11 18:46:04,159 WARN L631 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-01-11 18:46:04,282 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[30448,30461] [2023-01-11 18:46:04,301 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[30811,30824] [2023-01-11 18:46:04,324 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[31483,31496] [2023-01-11 18:46:04,325 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[31534,31547] [2023-01-11 18:46:04,327 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[31683,31696] [2023-01-11 18:46:04,330 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[31760,31773] [2023-01-11 18:46:04,333 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[31807,31820] [2023-01-11 18:46:04,337 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[31916,31929] [2023-01-11 18:46:04,342 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[32035,32048] [2023-01-11 18:46:04,343 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[32083,32096] [2023-01-11 18:46:04,344 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[32160,32173] [2023-01-11 18:46:04,345 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[32286,32299] [2023-01-11 18:46:04,351 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[32897,32910] [2023-01-11 18:46:04,352 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[32974,32987] [2023-01-11 18:46:04,352 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-11 18:46:04,365 INFO L203 MainTranslator]: Completed pre-run [2023-01-11 18:46:04,379 WARN L631 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-01-11 18:46:04,401 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[30448,30461] [2023-01-11 18:46:04,403 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[30811,30824] [2023-01-11 18:46:04,424 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[31483,31496] [2023-01-11 18:46:04,424 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[31534,31547] [2023-01-11 18:46:04,426 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[31683,31696] [2023-01-11 18:46:04,426 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[31760,31773] [2023-01-11 18:46:04,427 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[31807,31820] [2023-01-11 18:46:04,432 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[31916,31929] [2023-01-11 18:46:04,434 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[32035,32048] [2023-01-11 18:46:04,435 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[32083,32096] [2023-01-11 18:46:04,436 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[32160,32173] [2023-01-11 18:46:04,438 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[32286,32299] [2023-01-11 18:46:04,445 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[32897,32910] [2023-01-11 18:46:04,446 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[32974,32987] [2023-01-11 18:46:04,447 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-11 18:46:04,482 WARN L663 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-01-11 18:46:04,487 INFO L208 MainTranslator]: Completed translation [2023-01-11 18:46:04,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:46:04 WrapperNode [2023-01-11 18:46:04,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-11 18:46:04,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-11 18:46:04,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-11 18:46:04,488 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-11 18:46:04,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:46:04" (1/1) ... [2023-01-11 18:46:04,508 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:46:04" (1/1) ... [2023-01-11 18:46:04,553 INFO L138 Inliner]: procedures = 174, calls = 73, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 805 [2023-01-11 18:46:04,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-11 18:46:04,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-11 18:46:04,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-11 18:46:04,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-11 18:46:04,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:46:04" (1/1) ... [2023-01-11 18:46:04,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:46:04" (1/1) ... [2023-01-11 18:46:04,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:46:04" (1/1) ... [2023-01-11 18:46:04,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:46:04" (1/1) ... [2023-01-11 18:46:04,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:46:04" (1/1) ... [2023-01-11 18:46:04,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:46:04" (1/1) ... [2023-01-11 18:46:04,657 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:46:04" (1/1) ... [2023-01-11 18:46:04,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:46:04" (1/1) ... [2023-01-11 18:46:04,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-11 18:46:04,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-11 18:46:04,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-11 18:46:04,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-11 18:46:04,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:46:04" (1/1) ... [2023-01-11 18:46:04,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-11 18:46:04,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 18:46:04,697 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-01-11 18:46:04,722 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-01-11 18:46:04,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-11 18:46:04,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-11 18:46:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-01-11 18:46:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure worker_fn [2023-01-11 18:46:04,748 INFO L138 BoogieDeclarations]: Found implementation of procedure worker_fn [2023-01-11 18:46:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-11 18:46:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-01-11 18:46:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-11 18:46:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-01-11 18:46:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-11 18:46:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-11 18:46:04,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-11 18:46:04,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-11 18:46:04,751 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-11 18:46:04,900 INFO L236 CfgBuilder]: Building ICFG [2023-01-11 18:46:04,902 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-11 18:46:05,924 INFO L277 CfgBuilder]: Performing block encoding [2023-01-11 18:46:05,940 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-11 18:46:05,940 INFO L302 CfgBuilder]: Removed 16 assume(true) statements. [2023-01-11 18:46:05,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 06:46:05 BoogieIcfgContainer [2023-01-11 18:46:05,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-11 18:46:05,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-11 18:46:05,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-11 18:46:05,948 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-11 18:46:05,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 06:46:04" (1/3) ... [2023-01-11 18:46:05,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd54ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 06:46:05, skipping insertion in model container [2023-01-11 18:46:05,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:46:04" (2/3) ... [2023-01-11 18:46:05,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd54ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 06:46:05, skipping insertion in model container [2023-01-11 18:46:05,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 06:46:05" (3/3) ... [2023-01-11 18:46:05,952 INFO L112 eAbstractionObserver]: Analyzing ICFG one_time_barrier_twice_2t.i [2023-01-11 18:46:05,958 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-01-11 18:46:05,967 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-11 18:46:05,967 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 78 error locations. [2023-01-11 18:46:05,967 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-11 18:46:06,168 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-01-11 18:46:06,225 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-11 18:46:06,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-11 18:46:06,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 18:46:06,228 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-01-11 18:46:06,248 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-01-11 18:46:06,271 INFO L100 denceProviderFactory]: Independence Relation #2: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-11 18:46:06,282 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 2 independence relations. [2023-01-11 18:46:06,283 WARN L167 artialOrderCegarLoop]: Attention: Unsuitable combinations of independence relations may be unsound! [2023-01-11 18:46:06,283 WARN L168 artialOrderCegarLoop]: Only combine independence relations if you are sure the combination is sound. [2023-01-11 18:46:06,289 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE ======== [2023-01-11 18:46:06,295 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;@567277f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-11 18:46:06,295 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-11 18:46:06,358 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2023-01-11 18:46:06,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 18:46:06,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1400861980, now seen corresponding path program 1 times [2023-01-11 18:46:06,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 18:46:06,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353066978] [2023-01-11 18:46:06,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:06,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 18:46:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:07,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 18:46:07,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 18:46:07,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353066978] [2023-01-11 18:46:07,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353066978] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-11 18:46:07,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-11 18:46:07,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-11 18:46:07,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462650596] [2023-01-11 18:46:07,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-11 18:46:07,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-11 18:46:07,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 18:46:07,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-11 18:46:07,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-01-11 18:46:07,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:07,206 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 18:46:07,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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-01-11 18:46:07,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:07,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-11 18:46:07,296 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2023-01-11 18:46:07,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-11 18:46:07,312 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-01-11 18:46:07,314 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE was SAFE (1/113) [2023-01-11 18:46:07,332 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-11 18:46:07,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-11 18:46:07,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 18:46:07,375 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) [2023-01-11 18:46:07,377 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 [2023-01-11 18:46:07,382 INFO L100 denceProviderFactory]: Independence Relation #2: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-11 18:46:07,383 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 2 independence relations. [2023-01-11 18:46:07,383 WARN L167 artialOrderCegarLoop]: Attention: Unsuitable combinations of independence relations may be unsound! [2023-01-11 18:46:07,383 WARN L168 artialOrderCegarLoop]: Only combine independence relations if you are sure the combination is sound. [2023-01-11 18:46:07,383 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE ======== [2023-01-11 18:46:07,384 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;@567277f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-11 18:46:07,384 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-11 18:46:07,426 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE] === [2023-01-11 18:46:07,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 18:46:07,427 INFO L85 PathProgramCache]: Analyzing trace with hash -358686959, now seen corresponding path program 1 times [2023-01-11 18:46:07,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 18:46:07,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108127898] [2023-01-11 18:46:07,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:07,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 18:46:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:07,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 18:46:07,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 18:46:07,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108127898] [2023-01-11 18:46:07,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108127898] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-11 18:46:07,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-11 18:46:07,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-11 18:46:07,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814122591] [2023-01-11 18:46:07,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-11 18:46:07,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-11 18:46:07,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 18:46:07,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-11 18:46:07,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-11 18:46:07,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:07,471 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 18:46:07,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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-01-11 18:46:07,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:07,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:07,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-11 18:46:07,489 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE] === [2023-01-11 18:46:07,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 18:46:07,490 INFO L85 PathProgramCache]: Analyzing trace with hash -570743854, now seen corresponding path program 1 times [2023-01-11 18:46:07,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 18:46:07,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684245223] [2023-01-11 18:46:07,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:07,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 18:46:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:07,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 18:46:07,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 18:46:07,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684245223] [2023-01-11 18:46:07,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684245223] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-11 18:46:07,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-11 18:46:07,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-11 18:46:07,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769473757] [2023-01-11 18:46:07,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-11 18:46:07,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-11 18:46:07,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 18:46:07,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-11 18:46:07,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-11 18:46:07,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:07,546 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 18:46:07,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-11 18:46:07,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:07,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:07,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:07,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:46:07,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-11 18:46:07,606 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE] === [2023-01-11 18:46:07,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 18:46:07,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1952573596, now seen corresponding path program 1 times [2023-01-11 18:46:07,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 18:46:07,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717114383] [2023-01-11 18:46:07,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:07,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 18:46:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:07,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 18:46:07,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 18:46:07,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717114383] [2023-01-11 18:46:07,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717114383] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-11 18:46:07,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193528746] [2023-01-11 18:46:07,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:07,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-11 18:46:07,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 18:46:07,699 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-11 18:46:07,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-11 18:46:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:07,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-11 18:46:07,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-11 18:46:07,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 18:46:07,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-11 18:46:08,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 18:46:08,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193528746] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-11 18:46:08,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-11 18:46:08,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-01-11 18:46:08,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441654122] [2023-01-11 18:46:08,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-11 18:46:08,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-11 18:46:08,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 18:46:08,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-11 18:46:08,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-11 18:46:08,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:08,062 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 18:46:08,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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-01-11 18:46:08,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:08,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:46:08,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:46:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-11 18:46:08,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-11 18:46:08,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-11 18:46:08,333 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE] === [2023-01-11 18:46:08,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 18:46:08,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1212752906, now seen corresponding path program 2 times [2023-01-11 18:46:08,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 18:46:08,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673321249] [2023-01-11 18:46:08,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:08,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 18:46:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:09,018 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-01-11 18:46:09,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 18:46:09,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673321249] [2023-01-11 18:46:09,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673321249] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-11 18:46:09,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-11 18:46:09,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-11 18:46:09,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580357950] [2023-01-11 18:46:09,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-11 18:46:09,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-11 18:46:09,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 18:46:09,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-11 18:46:09,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-01-11 18:46:09,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:09,023 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 18:46:09,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 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-01-11 18:46:09,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:09,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:46:09,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-01-11 18:46:09,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:09,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:09,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:46:09,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-11 18:46:09,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-11 18:46:09,065 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2023-01-11 18:46:09,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-11 18:46:09,077 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2023-01-11 18:46:09,077 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE was SAFE (2/113) [2023-01-11 18:46:09,087 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-11 18:46:09,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-11 18:46:09,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 18:46:09,088 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-11 18:46:09,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2023-01-11 18:46:09,093 INFO L100 denceProviderFactory]: Independence Relation #2: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-11 18:46:09,094 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 2 independence relations. [2023-01-11 18:46:09,094 WARN L167 artialOrderCegarLoop]: Attention: Unsuitable combinations of independence relations may be unsound! [2023-01-11 18:46:09,094 WARN L168 artialOrderCegarLoop]: Only combine independence relations if you are sure the combination is sound. [2023-01-11 18:46:09,094 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE ======== [2023-01-11 18:46:09,095 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;@567277f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-11 18:46:09,095 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-11 18:46:09,115 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE] === [2023-01-11 18:46:09,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 18:46:09,116 INFO L85 PathProgramCache]: Analyzing trace with hash 411105279, now seen corresponding path program 1 times [2023-01-11 18:46:09,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 18:46:09,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703957095] [2023-01-11 18:46:09,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:09,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 18:46:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:09,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 18:46:09,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 18:46:09,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703957095] [2023-01-11 18:46:09,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703957095] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-11 18:46:09,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-11 18:46:09,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-11 18:46:09,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414273349] [2023-01-11 18:46:09,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-11 18:46:09,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-11 18:46:09,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 18:46:09,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-11 18:46:09,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-01-11 18:46:09,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:09,405 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 18:46:09,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 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-01-11 18:46:09,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:09,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-11 18:46:09,454 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2023-01-11 18:46:09,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-11 18:46:09,457 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-01-11 18:46:09,457 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE was SAFE (3/113) [2023-01-11 18:46:09,464 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-11 18:46:09,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-11 18:46:09,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 18:46:09,471 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-11 18:46:09,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2023-01-11 18:46:09,475 INFO L100 denceProviderFactory]: Independence Relation #2: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-11 18:46:09,476 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 2 independence relations. [2023-01-11 18:46:09,476 WARN L167 artialOrderCegarLoop]: Attention: Unsuitable combinations of independence relations may be unsound! [2023-01-11 18:46:09,476 WARN L168 artialOrderCegarLoop]: Only combine independence relations if you are sure the combination is sound. [2023-01-11 18:46:09,476 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE ======== [2023-01-11 18:46:09,476 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;@567277f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-11 18:46:09,476 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-11 18:46:09,503 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE] === [2023-01-11 18:46:09,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 18:46:09,504 INFO L85 PathProgramCache]: Analyzing trace with hash -114098153, now seen corresponding path program 1 times [2023-01-11 18:46:09,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 18:46:09,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738437408] [2023-01-11 18:46:09,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:09,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 18:46:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:09,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 18:46:09,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 18:46:09,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738437408] [2023-01-11 18:46:09,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738437408] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-11 18:46:09,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-11 18:46:09,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-11 18:46:09,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979373858] [2023-01-11 18:46:09,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-11 18:46:09,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-11 18:46:09,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 18:46:09,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-11 18:46:09,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-11 18:46:09,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:09,538 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 18:46:09,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 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-01-11 18:46:09,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:09,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:09,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-11 18:46:09,558 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE] === [2023-01-11 18:46:09,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 18:46:09,558 INFO L85 PathProgramCache]: Analyzing trace with hash -979176488, now seen corresponding path program 1 times [2023-01-11 18:46:09,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 18:46:09,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214811539] [2023-01-11 18:46:09,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:09,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 18:46:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:09,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 18:46:09,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 18:46:09,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214811539] [2023-01-11 18:46:09,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214811539] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-11 18:46:09,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-11 18:46:09,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-11 18:46:09,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705563363] [2023-01-11 18:46:09,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-11 18:46:09,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-11 18:46:09,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 18:46:09,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-11 18:46:09,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-11 18:46:09,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:09,602 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 18:46:09,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-01-11 18:46:09,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:09,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:09,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:09,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:46:09,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-11 18:46:09,653 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE] === [2023-01-11 18:46:09,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 18:46:09,653 INFO L85 PathProgramCache]: Analyzing trace with hash 900347242, now seen corresponding path program 1 times [2023-01-11 18:46:09,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 18:46:09,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793616767] [2023-01-11 18:46:09,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:09,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 18:46:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 18:46:09,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 18:46:09,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793616767] [2023-01-11 18:46:09,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793616767] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-11 18:46:09,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415796045] [2023-01-11 18:46:09,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:09,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-11 18:46:09,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 18:46:09,743 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-11 18:46:09,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-11 18:46:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:09,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-11 18:46:09,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-11 18:46:09,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 18:46:09,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-11 18:46:09,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 18:46:09,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415796045] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-11 18:46:09,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-11 18:46:09,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-01-11 18:46:09,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087571653] [2023-01-11 18:46:09,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-11 18:46:09,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-11 18:46:09,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 18:46:09,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-11 18:46:09,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-11 18:46:09,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:09,994 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 18:46:09,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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-01-11 18:46:09,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:09,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:46:09,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:10,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:10,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:46:10,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-11 18:46:10,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-11 18:46:10,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-11 18:46:10,262 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE] === [2023-01-11 18:46:10,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 18:46:10,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1111078916, now seen corresponding path program 2 times [2023-01-11 18:46:10,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 18:46:10,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103299457] [2023-01-11 18:46:10,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:10,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 18:46:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:10,802 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-01-11 18:46:10,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 18:46:10,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103299457] [2023-01-11 18:46:10,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103299457] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-11 18:46:10,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-11 18:46:10,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-11 18:46:10,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294276193] [2023-01-11 18:46:10,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-11 18:46:10,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-11 18:46:10,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 18:46:10,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-11 18:46:10,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-01-11 18:46:10,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:10,804 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 18:46:10,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 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-01-11 18:46:10,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:10,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:46:10,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-01-11 18:46:10,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:10,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:10,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:46:10,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-11 18:46:10,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-11 18:46:10,863 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2023-01-11 18:46:10,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-11 18:46:10,869 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2023-01-11 18:46:10,869 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE was SAFE (4/113) [2023-01-11 18:46:10,877 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-11 18:46:10,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-11 18:46:10,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 18:46:10,879 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-11 18:46:10,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2023-01-11 18:46:10,884 INFO L100 denceProviderFactory]: Independence Relation #2: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-11 18:46:10,885 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 2 independence relations. [2023-01-11 18:46:10,885 WARN L167 artialOrderCegarLoop]: Attention: Unsuitable combinations of independence relations may be unsound! [2023-01-11 18:46:10,885 WARN L168 artialOrderCegarLoop]: Only combine independence relations if you are sure the combination is sound. [2023-01-11 18:46:10,885 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE ======== [2023-01-11 18:46:10,886 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;@567277f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-11 18:46:10,886 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-11 18:46:10,905 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE] === [2023-01-11 18:46:10,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 18:46:10,906 INFO L85 PathProgramCache]: Analyzing trace with hash 385745512, now seen corresponding path program 1 times [2023-01-11 18:46:10,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 18:46:10,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753960726] [2023-01-11 18:46:10,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:10,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 18:46:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:11,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 18:46:11,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 18:46:11,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753960726] [2023-01-11 18:46:11,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753960726] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-11 18:46:11,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-11 18:46:11,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-11 18:46:11,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703450059] [2023-01-11 18:46:11,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-11 18:46:11,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-11 18:46:11,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 18:46:11,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-11 18:46:11,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-01-11 18:46:11,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:11,188 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 18:46:11,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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-01-11 18:46:11,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:11,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-11 18:46:11,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2023-01-11 18:46:11,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-11 18:46:11,232 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-01-11 18:46:11,233 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE was SAFE (5/113) [2023-01-11 18:46:11,239 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-11 18:46:11,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-11 18:46:11,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 18:46:11,242 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-11 18:46:11,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2023-01-11 18:46:11,246 INFO L100 denceProviderFactory]: Independence Relation #2: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-11 18:46:11,247 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 2 independence relations. [2023-01-11 18:46:11,247 WARN L167 artialOrderCegarLoop]: Attention: Unsuitable combinations of independence relations may be unsound! [2023-01-11 18:46:11,247 WARN L168 artialOrderCegarLoop]: Only combine independence relations if you are sure the combination is sound. [2023-01-11 18:46:11,247 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE ======== [2023-01-11 18:46:11,247 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;@567277f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-11 18:46:11,248 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-11 18:46:11,274 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE] === [2023-01-11 18:46:11,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 18:46:11,274 INFO L85 PathProgramCache]: Analyzing trace with hash -173824812, now seen corresponding path program 1 times [2023-01-11 18:46:11,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 18:46:11,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100696726] [2023-01-11 18:46:11,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:11,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 18:46:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:11,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 18:46:11,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 18:46:11,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100696726] [2023-01-11 18:46:11,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100696726] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-11 18:46:11,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-11 18:46:11,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-11 18:46:11,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682957192] [2023-01-11 18:46:11,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-11 18:46:11,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-11 18:46:11,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 18:46:11,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-11 18:46:11,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-11 18:46:11,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:11,302 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 18:46:11,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-11 18:46:11,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:11,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:11,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-11 18:46:11,307 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE] === [2023-01-11 18:46:11,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 18:46:11,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1292661898, now seen corresponding path program 1 times [2023-01-11 18:46:11,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 18:46:11,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009883579] [2023-01-11 18:46:11,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:11,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 18:46:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:11,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 18:46:11,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 18:46:11,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009883579] [2023-01-11 18:46:11,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009883579] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-11 18:46:11,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-11 18:46:11,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-11 18:46:11,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253094619] [2023-01-11 18:46:11,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-11 18:46:11,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-11 18:46:11,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 18:46:11,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-11 18:46:11,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-11 18:46:11,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:11,351 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 18:46:11,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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-01-11 18:46:11,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:11,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:11,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:11,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:46:11,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-11 18:46:11,417 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE] === [2023-01-11 18:46:11,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 18:46:11,418 INFO L85 PathProgramCache]: Analyzing trace with hash -2644600, now seen corresponding path program 1 times [2023-01-11 18:46:11,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 18:46:11,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356103195] [2023-01-11 18:46:11,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:11,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 18:46:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:11,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 18:46:11,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 18:46:11,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356103195] [2023-01-11 18:46:11,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356103195] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-11 18:46:11,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244167869] [2023-01-11 18:46:11,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:11,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-11 18:46:11,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 18:46:11,496 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-11 18:46:11,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-11 18:46:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:11,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-11 18:46:11,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-11 18:46:11,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 18:46:11,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-11 18:46:11,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 18:46:11,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244167869] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-11 18:46:11,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-11 18:46:11,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-01-11 18:46:11,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930604191] [2023-01-11 18:46:11,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-11 18:46:11,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-11 18:46:11,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 18:46:11,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-11 18:46:11,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-11 18:46:11,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:11,763 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 18:46:11,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-01-11 18:46:11,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:11,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:46:11,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:46:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-11 18:46:11,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-01-11 18:46:12,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-01-11 18:46:12,027 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE] === [2023-01-11 18:46:12,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 18:46:12,027 INFO L85 PathProgramCache]: Analyzing trace with hash -745615206, now seen corresponding path program 2 times [2023-01-11 18:46:12,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 18:46:12,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348422516] [2023-01-11 18:46:12,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:12,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 18:46:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:12,516 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-01-11 18:46:12,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 18:46:12,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348422516] [2023-01-11 18:46:12,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348422516] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-11 18:46:12,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-11 18:46:12,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-11 18:46:12,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906487282] [2023-01-11 18:46:12,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-11 18:46:12,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-11 18:46:12,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 18:46:12,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-11 18:46:12,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-01-11 18:46:12,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:12,519 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 18:46:12,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.2) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-11 18:46:12,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:12,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:46:12,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-01-11 18:46:12,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:12,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:12,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:46:12,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-11 18:46:12,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-11 18:46:12,565 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2023-01-11 18:46:12,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-11 18:46:12,570 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2023-01-11 18:46:12,570 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE was SAFE (6/113) [2023-01-11 18:46:12,576 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-11 18:46:12,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-11 18:46:12,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 18:46:12,578 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-11 18:46:12,589 INFO L100 denceProviderFactory]: Independence Relation #2: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-11 18:46:12,590 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 2 independence relations. [2023-01-11 18:46:12,590 WARN L167 artialOrderCegarLoop]: Attention: Unsuitable combinations of independence relations may be unsound! [2023-01-11 18:46:12,590 WARN L168 artialOrderCegarLoop]: Only combine independence relations if you are sure the combination is sound. [2023-01-11 18:46:12,590 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE ======== [2023-01-11 18:46:12,591 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;@567277f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-11 18:46:12,591 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-11 18:46:12,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2023-01-11 18:46:12,612 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE] === [2023-01-11 18:46:12,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 18:46:12,613 INFO L85 PathProgramCache]: Analyzing trace with hash -699363647, now seen corresponding path program 1 times [2023-01-11 18:46:12,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 18:46:12,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415668960] [2023-01-11 18:46:12,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:12,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 18:46:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:12,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 18:46:12,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 18:46:12,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415668960] [2023-01-11 18:46:12,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415668960] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-11 18:46:12,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-11 18:46:12,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-11 18:46:12,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684339622] [2023-01-11 18:46:12,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-11 18:46:12,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-11 18:46:12,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 18:46:12,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-11 18:46:12,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-11 18:46:12,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:12,641 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 18:46:12,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 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-01-11 18:46:12,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:12,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:12,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-11 18:46:12,646 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE] === [2023-01-11 18:46:12,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 18:46:12,646 INFO L85 PathProgramCache]: Analyzing trace with hash 598258531, now seen corresponding path program 1 times [2023-01-11 18:46:12,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 18:46:12,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047321290] [2023-01-11 18:46:12,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:12,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 18:46:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 18:46:12,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 18:46:12,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047321290] [2023-01-11 18:46:12,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047321290] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-11 18:46:12,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-11 18:46:12,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-11 18:46:12,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896245445] [2023-01-11 18:46:12,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-11 18:46:12,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-11 18:46:12,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 18:46:12,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-11 18:46:12,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-11 18:46:12,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:12,690 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 18:46:12,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-01-11 18:46:12,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:12,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:12,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:12,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:46:12,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-01-11 18:46:12,731 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE] === [2023-01-11 18:46:12,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 18:46:12,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1398629515, now seen corresponding path program 1 times [2023-01-11 18:46:12,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 18:46:12,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043203566] [2023-01-11 18:46:12,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:12,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 18:46:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:12,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 18:46:12,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 18:46:12,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043203566] [2023-01-11 18:46:12,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043203566] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-11 18:46:12,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39625031] [2023-01-11 18:46:12,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:12,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-11 18:46:12,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 18:46:12,840 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-11 18:46:12,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-01-11 18:46:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:13,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-11 18:46:13,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-11 18:46:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 18:46:13,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-11 18:46:13,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 18:46:13,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39625031] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-11 18:46:13,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-11 18:46:13,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-01-11 18:46:13,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680456384] [2023-01-11 18:46:13,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-11 18:46:13,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-11 18:46:13,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 18:46:13,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-11 18:46:13,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-11 18:46:13,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:13,132 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 18:46:13,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 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-01-11 18:46:13,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:13,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:46:13,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:13,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:13,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:46:13,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-11 18:46:13,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-01-11 18:46:13,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-01-11 18:46:13,391 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE] === [2023-01-11 18:46:13,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 18:46:13,392 INFO L85 PathProgramCache]: Analyzing trace with hash -993094521, now seen corresponding path program 2 times [2023-01-11 18:46:13,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 18:46:13,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616537906] [2023-01-11 18:46:13,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:13,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 18:46:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:13,932 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-01-11 18:46:13,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 18:46:13,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616537906] [2023-01-11 18:46:13,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616537906] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-11 18:46:13,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-11 18:46:13,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-11 18:46:13,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150196677] [2023-01-11 18:46:13,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-11 18:46:13,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-11 18:46:13,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 18:46:13,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-11 18:46:13,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-01-11 18:46:13,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:13,935 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 18:46:13,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.8) internal successors, (104), 6 states have internal predecessors, (104), 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-01-11 18:46:13,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:13,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:46:13,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-01-11 18:46:13,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:14,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:14,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:46:14,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-11 18:46:14,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-11 18:46:14,014 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2023-01-11 18:46:14,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-01-11 18:46:14,016 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2023-01-11 18:46:14,017 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE was SAFE (7/113) [2023-01-11 18:46:14,023 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-11 18:46:14,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-11 18:46:14,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 18:46:14,024 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-11 18:46:14,032 INFO L100 denceProviderFactory]: Independence Relation #2: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-11 18:46:14,033 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 2 independence relations. [2023-01-11 18:46:14,033 WARN L167 artialOrderCegarLoop]: Attention: Unsuitable combinations of independence relations may be unsound! [2023-01-11 18:46:14,033 WARN L168 artialOrderCegarLoop]: Only combine independence relations if you are sure the combination is sound. [2023-01-11 18:46:14,033 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE ======== [2023-01-11 18:46:14,033 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;@567277f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-11 18:46:14,033 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-11 18:46:14,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Waiting until timeout for monitored process [2023-01-11 18:46:14,404 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE] === [2023-01-11 18:46:14,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 18:46:14,405 INFO L85 PathProgramCache]: Analyzing trace with hash 130293262, now seen corresponding path program 1 times [2023-01-11 18:46:14,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 18:46:14,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735079] [2023-01-11 18:46:14,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:14,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 18:46:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:14,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-11 18:46:14,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 18:46:14,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735079] [2023-01-11 18:46:14,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735079] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-11 18:46:14,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-11 18:46:14,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-11 18:46:14,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947132865] [2023-01-11 18:46:14,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-11 18:46:14,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-11 18:46:14,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 18:46:14,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-11 18:46:14,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-11 18:46:14,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:14,442 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 18:46:14,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 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-01-11 18:46:14,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:14,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:14,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-01-11 18:46:14,561 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE] === [2023-01-11 18:46:14,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 18:46:14,562 INFO L85 PathProgramCache]: Analyzing trace with hash -323214292, now seen corresponding path program 1 times [2023-01-11 18:46:14,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 18:46:14,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622449513] [2023-01-11 18:46:14,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:14,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 18:46:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:14,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-11 18:46:14,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 18:46:14,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622449513] [2023-01-11 18:46:14,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622449513] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-11 18:46:14,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-11 18:46:14,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-11 18:46:14,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931087825] [2023-01-11 18:46:14,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-11 18:46:14,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-11 18:46:14,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 18:46:14,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-11 18:46:14,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-11 18:46:14,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:14,614 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 18:46:14,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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-01-11 18:46:14,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:14,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:14,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:14,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:46:14,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-01-11 18:46:14,747 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE] === [2023-01-11 18:46:14,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 18:46:14,747 INFO L85 PathProgramCache]: Analyzing trace with hash -310132518, now seen corresponding path program 1 times [2023-01-11 18:46:14,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 18:46:14,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773382510] [2023-01-11 18:46:14,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:14,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 18:46:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:14,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-11 18:46:14,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 18:46:14,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773382510] [2023-01-11 18:46:14,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773382510] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-11 18:46:14,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919623790] [2023-01-11 18:46:14,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:14,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-11 18:46:14,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 18:46:14,836 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-11 18:46:14,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-01-11 18:46:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:15,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-11 18:46:15,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-11 18:46:15,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-11 18:46:15,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-11 18:46:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-11 18:46:15,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919623790] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-11 18:46:15,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-11 18:46:15,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-01-11 18:46:15,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292104838] [2023-01-11 18:46:15,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-11 18:46:15,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-11 18:46:15,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 18:46:15,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-11 18:46:15,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-11 18:46:15,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:15,154 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 18:46:15,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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-01-11 18:46:15,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:15,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:46:15,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:15,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:15,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:46:15,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-11 18:46:15,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-01-11 18:46:15,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-01-11 18:46:15,516 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE] === [2023-01-11 18:46:15,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 18:46:15,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1364634760, now seen corresponding path program 2 times [2023-01-11 18:46:15,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 18:46:15,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914685567] [2023-01-11 18:46:15,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:15,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 18:46:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:16,093 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-01-11 18:46:16,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 18:46:16,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914685567] [2023-01-11 18:46:16,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914685567] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-11 18:46:16,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-11 18:46:16,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-11 18:46:16,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259885255] [2023-01-11 18:46:16,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-11 18:46:16,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-11 18:46:16,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 18:46:16,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-11 18:46:16,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-01-11 18:46:16,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:16,096 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 18:46:16,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.2) internal successors, (131), 6 states have internal predecessors, (131), 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-01-11 18:46:16,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:16,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:46:16,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-01-11 18:46:16,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:16,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:46:16,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:46:16,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-11 18:46:16,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-11 18:46:16,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-01-11 18:46:16,566 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE] === [2023-01-11 18:46:16,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 18:46:16,566 INFO L85 PathProgramCache]: Analyzing trace with hash 738574317, now seen corresponding path program 1 times [2023-01-11 18:46:16,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 18:46:16,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780748773] [2023-01-11 18:46:16,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:16,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 18:46:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:19,501 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-01-11 18:46:19,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 18:46:19,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780748773] [2023-01-11 18:46:19,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780748773] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-11 18:46:19,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50921642] [2023-01-11 18:46:19,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:46:19,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-11 18:46:19,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 18:46:19,505 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-11 18:46:19,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-01-11 18:46:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:46:19,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 70 conjunts are in the unsatisfiable core [2023-01-11 18:46:19,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-11 18:46:19,976 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-01-11 18:46:19,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-01-11 18:46:19,993 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-01-11 18:46:19,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-01-11 18:46:20,034 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-11 18:46:20,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-11 18:46:20,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-11 18:46:20,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-01-11 18:46:20,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2023-01-11 18:46:20,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2023-01-11 18:46:21,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:46:21,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:46:21,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:46:21,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:46:21,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2023-01-11 18:46:21,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:46:21,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:46:21,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:46:21,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:46:21,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2023-01-11 18:46:21,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:46:21,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:46:21,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:46:21,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:46:21,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2023-01-11 18:46:21,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:46:21,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:46:21,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:46:21,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:46:21,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2023-01-11 18:46:31,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 53 [2023-01-11 18:46:41,632 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-11 18:46:41,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-11 18:46:41,658 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2575 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2575) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11)) 0)) (forall ((v_ArrVal_2575 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2575) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) 0)) (forall ((v_ArrVal_2575 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2575) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) 0)) (forall ((v_ArrVal_2575 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2575) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) 0))) is different from false [2023-01-11 18:46:57,344 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse2 0)))) (let ((.cse1 (select .cse0 |c_worker_fnThread1of1ForFork0_#in~arg#1.base|))) (and (forall ((v_ArrVal_2570 Int) (v_ArrVal_2572 Int) (|v_worker_fnThread1of1ForFork0_~a~0#1.offset_48| Int) (v_ArrVal_2575 (Array Int Int))) (or (= 0 (select (select (store (store .cse0 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store .cse1 (+ 8 |v_worker_fnThread1of1ForFork0_~a~0#1.offset_48|) 0) (+ 9 |v_worker_fnThread1of1ForFork0_~a~0#1.offset_48|) v_ArrVal_2570) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_48| 10) v_ArrVal_2572) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_48| 11) 0)) |c_~#pre~0.base| v_ArrVal_2575) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse2)) (< |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| |v_worker_fnThread1of1ForFork0_~a~0#1.offset_48|))) (forall ((v_ArrVal_2570 Int) (v_ArrVal_2572 Int) (|v_worker_fnThread1of1ForFork0_~a~0#1.offset_48| Int) (v_ArrVal_2575 (Array Int Int))) (or (= (select (select (store (store .cse0 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store .cse1 (+ 8 |v_worker_fnThread1of1ForFork0_~a~0#1.offset_48|) 0) (+ 9 |v_worker_fnThread1of1ForFork0_~a~0#1.offset_48|) v_ArrVal_2570) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_48| 10) v_ArrVal_2572) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_48| 11) 0)) |c_~#pre~0.base| v_ArrVal_2575) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) 0) (< |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| |v_worker_fnThread1of1ForFork0_~a~0#1.offset_48|))) (forall ((v_ArrVal_2570 Int) (v_ArrVal_2572 Int) (|v_worker_fnThread1of1ForFork0_~a~0#1.offset_48| Int) (v_ArrVal_2575 (Array Int Int))) (or (= (select (select (store (store .cse0 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store .cse1 (+ 8 |v_worker_fnThread1of1ForFork0_~a~0#1.offset_48|) 0) (+ 9 |v_worker_fnThread1of1ForFork0_~a~0#1.offset_48|) v_ArrVal_2570) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_48| 10) v_ArrVal_2572) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_48| 11) 0)) |c_~#pre~0.base| v_ArrVal_2575) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) 0) (< |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| |v_worker_fnThread1of1ForFork0_~a~0#1.offset_48|))) (forall ((v_ArrVal_2570 Int) (v_ArrVal_2572 Int) (|v_worker_fnThread1of1ForFork0_~a~0#1.offset_48| Int) (v_ArrVal_2575 (Array Int Int))) (or (= (select (select (store (store .cse0 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store .cse1 (+ 8 |v_worker_fnThread1of1ForFork0_~a~0#1.offset_48|) 0) (+ 9 |v_worker_fnThread1of1ForFork0_~a~0#1.offset_48|) v_ArrVal_2570) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_48| 10) v_ArrVal_2572) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_48| 11) 0)) |c_~#pre~0.base| v_ArrVal_2575) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) 0) (< |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| |v_worker_fnThread1of1ForFork0_~a~0#1.offset_48|))))))) is different from false [2023-01-11 18:47:23,094 INFO L321 Elim1Store]: treesize reduction 632, result has 21.1 percent of original size [2023-01-11 18:47:23,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 181 [2023-01-11 18:47:23,111 INFO L321 Elim1Store]: treesize reduction 100, result has 1.0 percent of original size [2023-01-11 18:47:23,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 174 treesize of output 132 [2023-01-11 18:47:23,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-01-11 18:47:23,233 INFO L321 Elim1Store]: treesize reduction 800, result has 0.1 percent of original size [2023-01-11 18:47:23,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 1 [2023-01-11 18:47:23,282 INFO L321 Elim1Store]: treesize reduction 800, result has 0.1 percent of original size [2023-01-11 18:47:23,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 1 [2023-01-11 18:47:23,338 INFO L321 Elim1Store]: treesize reduction 800, result has 0.1 percent of original size [2023-01-11 18:47:23,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 1 [2023-01-11 18:47:26,733 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-01-11 18:47:26,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-01-11 18:47:26,737 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-01-11 18:47:26,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50921642] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-11 18:47:26,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-11 18:47:26,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 21] total 54 [2023-01-11 18:47:26,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122806629] [2023-01-11 18:47:26,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-11 18:47:26,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-01-11 18:47:26,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 18:47:26,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-01-11 18:47:26,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2386, Unknown=85, NotChecked=206, Total=2970 [2023-01-11 18:47:26,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:47:26,742 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 18:47:26,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 7.796296296296297) internal successors, (421), 55 states have internal predecessors, (421), 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-01-11 18:47:26,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:47:26,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:47:26,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-01-11 18:47:26,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-11 18:47:26,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:48:57,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-11 18:49:04,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:49:06,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:49:12,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:49:14,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:49:21,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:49:23,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:49:29,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:49:31,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:49:51,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:49:53,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:49:55,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:49:57,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:00,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:02,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:04,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:06,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:08,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:10,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:12,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:14,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:16,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:18,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:20,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:22,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:24,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:26,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:28,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:30,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:32,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:34,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:36,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:38,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:40,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:42,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:44,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:46,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:48,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:50,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:52,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:54,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:56,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:50:58,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:00,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:02,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:04,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:06,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:08,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:10,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:12,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:14,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:16,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:18,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:20,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:22,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:24,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:26,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:29,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:31,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:33,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:35,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:37,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:39,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:41,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:43,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:45,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:47,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:49,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:51,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:53,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:55,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:57,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:51:59,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:01,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:03,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:05,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:07,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:09,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:11,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:13,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:15,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:17,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:19,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:21,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:23,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:25,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:27,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:29,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:31,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:33,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:35,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:37,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:39,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:41,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:43,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:45,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:47,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:49,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:51,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:53,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:55,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:57,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:52:59,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:53:01,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:53:03,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:53:05,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:53:07,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:53:09,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:53:11,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:53:13,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:53:15,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-11 18:53:15,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:53:15,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:53:15,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-11 18:53:15,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-11 18:53:15,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-01-11 18:53:15,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-01-11 18:53:15,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-11 18:53:15,890 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE] === [2023-01-11 18:53:15,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 18:53:15,890 INFO L85 PathProgramCache]: Analyzing trace with hash 588047742, now seen corresponding path program 1 times [2023-01-11 18:53:15,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 18:53:15,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420731603] [2023-01-11 18:53:15,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:53:15,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 18:53:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:53:16,029 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-01-11 18:53:16,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 18:53:16,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420731603] [2023-01-11 18:53:16,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420731603] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-11 18:53:16,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-11 18:53:16,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-11 18:53:16,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849208274] [2023-01-11 18:53:16,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-11 18:53:16,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-11 18:53:16,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 18:53:16,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-11 18:53:16,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-11 18:53:16,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:53:16,032 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 18:53:16,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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-01-11 18:53:16,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:53:16,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:53:16,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-01-11 18:53:16,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-11 18:53:16,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-01-11 18:53:16,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:53:16,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:53:16,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:53:16,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-11 18:53:16,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-11 18:53:16,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-01-11 18:53:16,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:53:16,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-01-11 18:53:16,172 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE] === [2023-01-11 18:53:16,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 18:53:16,173 INFO L85 PathProgramCache]: Analyzing trace with hash -715038037, now seen corresponding path program 1 times [2023-01-11 18:53:16,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 18:53:16,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136958987] [2023-01-11 18:53:16,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:53:16,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 18:53:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:53:16,352 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-01-11 18:53:16,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 18:53:16,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136958987] [2023-01-11 18:53:16,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136958987] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-11 18:53:16,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310302491] [2023-01-11 18:53:16,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:53:16,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-11 18:53:16,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 18:53:16,357 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-11 18:53:16,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-01-11 18:53:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:53:16,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-11 18:53:16,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-11 18:53:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-01-11 18:53:16,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-11 18:53:16,777 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-01-11 18:53:16,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310302491] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-11 18:53:16,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-11 18:53:16,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-01-11 18:53:16,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690419697] [2023-01-11 18:53:16,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-11 18:53:16,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-11 18:53:16,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 18:53:16,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-11 18:53:16,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-11 18:53:16,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:53:16,782 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 18:53:16,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 states have internal predecessors, (213), 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-01-11 18:53:16,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:53:16,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:53:16,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-01-11 18:53:16,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-11 18:53:16,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-01-11 18:53:16,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:53:16,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:53:16,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:53:16,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:53:16,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-11 18:53:16,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-11 18:53:16,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-01-11 18:53:16,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:53:16,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-11 18:53:16,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-01-11 18:53:17,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-01-11 18:53:17,126 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE] === [2023-01-11 18:53:17,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 18:53:17,126 INFO L85 PathProgramCache]: Analyzing trace with hash -752300776, now seen corresponding path program 2 times [2023-01-11 18:53:17,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 18:53:17,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612137539] [2023-01-11 18:53:17,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 18:53:17,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 18:53:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 18:53:28,772 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-11 18:53:28,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 18:53:28,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612137539] [2023-01-11 18:53:28,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612137539] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-11 18:53:28,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415989285] [2023-01-11 18:53:28,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-11 18:53:28,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-11 18:53:28,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 18:53:28,774 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-11 18:53:28,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-01-11 18:53:31,186 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-11 18:53:31,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-11 18:53:31,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 146 conjunts are in the unsatisfiable core [2023-01-11 18:53:31,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-11 18:53:31,383 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2023-01-11 18:53:31,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-01-11 18:53:31,459 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-01-11 18:53:31,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 57 [2023-01-11 18:53:31,608 INFO L321 Elim1Store]: treesize reduction 90, result has 33.8 percent of original size [2023-01-11 18:53:31,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 69 [2023-01-11 18:53:31,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-11 18:53:32,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-01-11 18:53:32,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-01-11 18:53:33,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-01-11 18:53:34,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2023-01-11 18:53:35,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:35,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-01-11 18:53:37,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-11 18:53:37,723 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-01-11 18:53:37,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2023-01-11 18:53:39,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2023-01-11 18:53:39,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2023-01-11 18:53:40,319 INFO L321 Elim1Store]: treesize reduction 24, result has 54.7 percent of original size [2023-01-11 18:53:40,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 50 [2023-01-11 18:53:40,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2023-01-11 18:53:41,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-11 18:53:41,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-01-11 18:53:41,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2023-01-11 18:53:41,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2023-01-11 18:53:42,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:42,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:42,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:42,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:42,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2023-01-11 18:53:42,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:42,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:42,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:42,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:42,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2023-01-11 18:53:42,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:42,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:42,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:42,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:42,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2023-01-11 18:53:42,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:42,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:42,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:42,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:42,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2023-01-11 18:53:42,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2023-01-11 18:53:42,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-01-11 18:53:42,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-01-11 18:53:43,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-01-11 18:53:43,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-01-11 18:53:43,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-01-11 18:53:44,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2023-01-11 18:53:44,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:44,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:44,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:44,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:44,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2023-01-11 18:53:44,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:44,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:44,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:44,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:44,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2023-01-11 18:53:44,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:44,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:44,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:44,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:44,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2023-01-11 18:53:44,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:44,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:44,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:44,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 18:53:44,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2023-01-11 18:53:44,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-01-11 18:53:44,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-01-11 18:53:44,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-01-11 18:53:44,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-01-11 18:53:44,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-01-11 18:53:44,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-01-11 18:53:45,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-01-11 18:53:45,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-01-11 18:53:45,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-01-11 18:53:45,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-01-11 18:53:45,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-01-11 18:53:45,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-01-11 18:53:45,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-01-11 18:53:45,513 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-11 18:53:45,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-11 18:53:45,531 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3782 (Array Int Int))) (= (select (select (store |c_#race| |c_worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11)) 0)) (forall ((v_ArrVal_3782 (Array Int Int))) (= (select (select (store |c_#race| |c_worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) 0)) (forall ((v_ArrVal_3782 (Array Int Int))) (= (select (select (store |c_#race| |c_worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) 0)) (forall ((v_ArrVal_3782 (Array Int Int))) (= (select (select (store |c_#race| |c_worker_fnThread1of1ForFork0_barrier_wait_~b#1.base| v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) 0))) is different from false [2023-01-11 18:53:45,741 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3782 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.base| v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11)))) (forall ((v_ArrVal_3782 (Array Int Int))) (= (select (select (store |c_#race| |c_worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.base| v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) 0)) (forall ((v_ArrVal_3782 (Array Int Int))) (= (select (select (store |c_#race| |c_worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.base| v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) 0)) (forall ((v_ArrVal_3782 (Array Int Int))) (= (select (select (store |c_#race| |c_worker_fnThread1of1ForFork0_barrier_wait_#in~b#1.base| v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) 0))) is different from false [2023-01-11 18:53:48,988 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (.cse2 (+ 2 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse3 (+ 3 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (and (forall ((v_ArrVal_3769 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int)) (= (select (select (store (let ((.cse0 (store (store |c_#race| |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) .cse4 v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) 0)) (forall ((v_ArrVal_3769 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int)) (= (select (select (store (let ((.cse5 (store (store |c_#race| |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse5 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse5 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) .cse4 v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) 0)) (forall ((v_ArrVal_3769 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int)) (= 0 (select (select (store (let ((.cse6 (store (store |c_#race| |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) .cse4 v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11)))) (forall ((v_ArrVal_3769 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int)) (= (select (select (store (let ((.cse7 (store (store |c_#race| |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) .cse4 v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) 0)))) is different from false [2023-01-11 18:53:49,269 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (.cse2 (+ 2 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse3 (+ 3 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (and (forall ((v_ArrVal_3769 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store (store |c_#race| |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) .cse4 v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) 0)) (forall ((v_ArrVal_3769 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse5 (store (store (store |c_#race| |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse5 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse5 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) .cse4 v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11)) 0)) (forall ((v_ArrVal_3769 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse6 (store (store (store |c_#race| |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) .cse4 v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) 0)) (forall ((v_ArrVal_3769 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse7 (store (store (store |c_#race| |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) .cse4 v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) 0)))) is different from false [2023-01-11 18:53:51,203 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (.cse2 (+ 2 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse3 (+ 3 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (and (forall ((v_ArrVal_3769 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store (store (store (store |c_#race| |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11)) 0)) (forall ((v_ArrVal_3769 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse4 (store (store (store (store (store |c_#race| |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse4 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse4 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) 0)) (forall ((v_ArrVal_3769 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse5 (store (store (store (store (store |c_#race| |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse5 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse5 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) 0)) (forall ((v_ArrVal_3769 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse6 (store (store (store (store (store |c_#race| |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) 0)))) is different from false [2023-01-11 18:53:51,371 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (.cse2 (+ 2 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse3 (+ 3 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse4 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (.cse5 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (and (forall ((v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store (store (store (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse4 .cse5 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) 0)) (forall ((v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse6 (store (store (store (store (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse4 .cse5 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11)) 0)) (forall ((v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse7 (store (store (store (store (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse4 .cse5 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) 0)) (forall ((v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse8 (store (store (store (store (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store .cse4 .cse5 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) 0)))) is different from false [2023-01-11 18:53:51,429 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (.cse2 (+ 2 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse3 (+ 3 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse4 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (.cse5 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse6 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (and (forall ((v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store (store (store (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store .cse4 .cse5 v_ArrVal_3752) .cse6 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) 0)) (forall ((v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse7 (store (store (store (store (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store .cse4 .cse5 v_ArrVal_3752) .cse6 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11)) 0)) (forall ((v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse8 (store (store (store (store (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store .cse4 .cse5 v_ArrVal_3752) .cse6 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) 0)) (forall ((v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse9 (store (store (store (store (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store .cse4 .cse5 v_ArrVal_3752) .cse6 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) 0)))) is different from false [2023-01-11 18:53:51,553 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (.cse2 (+ 2 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse3 (+ 3 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse4 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (.cse5 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse6 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse7 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (and (forall ((v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3750 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store (store (store (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store .cse4 .cse5 v_ArrVal_3750) .cse6 v_ArrVal_3752) .cse7 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) 0)) (forall ((v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3750 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse8 (store (store (store (store (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store .cse4 .cse5 v_ArrVal_3750) .cse6 v_ArrVal_3752) .cse7 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11)) 0)) (forall ((v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3750 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse9 (store (store (store (store (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store .cse4 .cse5 v_ArrVal_3750) .cse6 v_ArrVal_3752) .cse7 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) 0)) (forall ((v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3750 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse10 (store (store (store (store (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store .cse4 .cse5 v_ArrVal_3750) .cse6 v_ArrVal_3752) .cse7 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse10 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse10 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) 0)))) is different from false [2023-01-11 18:53:51,764 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_worker_fnThread1of1ForFork0_~a~0#1.offset| 1)) (.cse2 (+ 2 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse3 (+ 3 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse4 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|)) (.cse5 (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse6 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse7 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) (.cse8 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (and (forall ((v_ArrVal_3748 Int) (v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3750 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store (store (store (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store .cse4 .cse5 v_ArrVal_3748) .cse6 v_ArrVal_3750) .cse7 v_ArrVal_3752) .cse8 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) 0)) (forall ((v_ArrVal_3748 Int) (v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3750 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse9 (store (store (store (store (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store .cse4 .cse5 v_ArrVal_3748) .cse6 v_ArrVal_3750) .cse7 v_ArrVal_3752) .cse8 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11)) 0)) (forall ((v_ArrVal_3748 Int) (v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3750 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse10 (store (store (store (store (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store .cse4 .cse5 v_ArrVal_3748) .cse6 v_ArrVal_3750) .cse7 v_ArrVal_3752) .cse8 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse10 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse10 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) 0)) (forall ((v_ArrVal_3748 Int) (v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3750 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse11 (store (store (store (store (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store .cse4 .cse5 v_ArrVal_3748) .cse6 v_ArrVal_3750) .cse7 v_ArrVal_3752) .cse8 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse11 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select .cse11 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) 0)))) is different from false [2023-01-11 18:53:51,894 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_worker_fnThread1of1ForFork0_~arg#1.offset| 1)) (.cse2 (+ 2 |c_worker_fnThread1of1ForFork0_~arg#1.offset|)) (.cse3 (+ 3 |c_worker_fnThread1of1ForFork0_~arg#1.offset|)) (.cse4 (select |c_#race| |c_worker_fnThread1of1ForFork0_~arg#1.base|)) (.cse5 (+ |c_worker_fnThread1of1ForFork0_~arg#1.offset| 8)) (.cse6 (+ 9 |c_worker_fnThread1of1ForFork0_~arg#1.offset|)) (.cse7 (+ |c_worker_fnThread1of1ForFork0_~arg#1.offset| 10)) (.cse8 (+ |c_worker_fnThread1of1ForFork0_~arg#1.offset| 11))) (and (forall ((v_ArrVal_3748 Int) (v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3750 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store (store (store (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~arg#1.base| (store (store (store (store .cse4 .cse5 v_ArrVal_3748) .cse6 v_ArrVal_3750) .cse7 v_ArrVal_3752) .cse8 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse0 |c_worker_fnThread1of1ForFork0_~arg#1.base| (store (store (store (store (select .cse0 |c_worker_fnThread1of1ForFork0_~arg#1.base|) |c_worker_fnThread1of1ForFork0_~arg#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_~arg#1.base|) |c_worker_fnThread1of1ForFork0_~arg#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) 0)) (forall ((v_ArrVal_3748 Int) (v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3750 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse9 (store (store (store (store (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~arg#1.base| (store (store (store (store .cse4 .cse5 v_ArrVal_3748) .cse6 v_ArrVal_3750) .cse7 v_ArrVal_3752) .cse8 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse9 |c_worker_fnThread1of1ForFork0_~arg#1.base| (store (store (store (store (select .cse9 |c_worker_fnThread1of1ForFork0_~arg#1.base|) |c_worker_fnThread1of1ForFork0_~arg#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_~arg#1.base|) |c_worker_fnThread1of1ForFork0_~arg#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) 0)) (forall ((v_ArrVal_3748 Int) (v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3750 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse10 (store (store (store (store (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~arg#1.base| (store (store (store (store .cse4 .cse5 v_ArrVal_3748) .cse6 v_ArrVal_3750) .cse7 v_ArrVal_3752) .cse8 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse10 |c_worker_fnThread1of1ForFork0_~arg#1.base| (store (store (store (store (select .cse10 |c_worker_fnThread1of1ForFork0_~arg#1.base|) |c_worker_fnThread1of1ForFork0_~arg#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_~arg#1.base|) |c_worker_fnThread1of1ForFork0_~arg#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) 0)) (forall ((v_ArrVal_3748 Int) (v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3750 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse11 (store (store (store (store (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~arg#1.base| (store (store (store (store .cse4 .cse5 v_ArrVal_3748) .cse6 v_ArrVal_3750) .cse7 v_ArrVal_3752) .cse8 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse11 |c_worker_fnThread1of1ForFork0_~arg#1.base| (store (store (store (store (select .cse11 |c_worker_fnThread1of1ForFork0_~arg#1.base|) |c_worker_fnThread1of1ForFork0_~arg#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_~arg#1.base|) |c_worker_fnThread1of1ForFork0_~arg#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11)) 0)))) is different from false [2023-01-11 18:53:52,033 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| 1)) (.cse2 (+ |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| 2)) (.cse3 (+ |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| 3)) (.cse4 (select |c_#race| |c_worker_fnThread1of1ForFork0_#in~arg#1.base|)) (.cse5 (+ |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| 8)) (.cse6 (+ |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| 9)) (.cse7 (+ |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| 10)) (.cse8 (+ |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| 11))) (and (forall ((v_ArrVal_3748 Int) (v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3750 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store (store (store (store (store |c_#race| |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store .cse4 .cse5 v_ArrVal_3748) .cse6 v_ArrVal_3750) .cse7 v_ArrVal_3752) .cse8 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse0 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select .cse0 |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) 0)) (forall ((v_ArrVal_3748 Int) (v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3750 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse9 (store (store (store (store (store (store |c_#race| |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store .cse4 .cse5 v_ArrVal_3748) .cse6 v_ArrVal_3750) .cse7 v_ArrVal_3752) .cse8 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse9 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select .cse9 |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) 0)) (forall ((v_ArrVal_3748 Int) (v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3750 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse10 (store (store (store (store (store (store |c_#race| |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store .cse4 .cse5 v_ArrVal_3748) .cse6 v_ArrVal_3750) .cse7 v_ArrVal_3752) .cse8 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse10 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select .cse10 |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11)) 0)) (forall ((v_ArrVal_3748 Int) (v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3750 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse11 (store (store (store (store (store (store |c_#race| |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store .cse4 .cse5 v_ArrVal_3748) .cse6 v_ArrVal_3750) .cse7 v_ArrVal_3752) .cse8 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse11 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select .cse11 |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) 0)))) is different from false [2023-01-11 18:53:52,189 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11))) (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse13 0)))) (let ((.cse1 (+ |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| 1)) (.cse2 (+ |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| 2)) (.cse3 (+ |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| 3)) (.cse5 (select .cse4 |c_worker_fnThread1of1ForFork0_#in~arg#1.base|)) (.cse6 (+ |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| 8)) (.cse7 (+ |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| 9)) (.cse8 (+ |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| 10)) (.cse9 (+ |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| 11))) (and (forall ((v_ArrVal_3748 Int) (v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3750 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store (store (store (store (store .cse4 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store .cse5 .cse6 v_ArrVal_3748) .cse7 v_ArrVal_3750) .cse8 v_ArrVal_3752) .cse9 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse0 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select .cse0 |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) 0)) (forall ((v_ArrVal_3748 Int) (v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3750 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse10 (store (store (store (store (store (store .cse4 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store .cse5 .cse6 v_ArrVal_3748) .cse7 v_ArrVal_3750) .cse8 v_ArrVal_3752) .cse9 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse10 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select .cse10 |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) 0)) (forall ((v_ArrVal_3748 Int) (v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3750 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse11 (store (store (store (store (store (store .cse4 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store .cse5 .cse6 v_ArrVal_3748) .cse7 v_ArrVal_3750) .cse8 v_ArrVal_3752) .cse9 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse11 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select .cse11 |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) 0)) (forall ((v_ArrVal_3748 Int) (v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3750 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse12 (store (store (store (store (store (store .cse4 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store .cse5 .cse6 v_ArrVal_3748) .cse7 v_ArrVal_3750) .cse8 v_ArrVal_3752) .cse9 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse12 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select .cse12 |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse13) 0)))))) is different from false [2023-01-11 18:53:52,338 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) (.cse14 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11))) (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse11 0) .cse14 0)))) (let ((.cse1 (+ |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| 1)) (.cse2 (+ |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| 2)) (.cse3 (+ |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| 3)) (.cse5 (select .cse4 |c_worker_fnThread1of1ForFork0_#in~arg#1.base|)) (.cse6 (+ |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| 8)) (.cse7 (+ |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| 9)) (.cse8 (+ |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| 10)) (.cse9 (+ |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| 11))) (and (forall ((v_ArrVal_3748 Int) (v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3750 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store (store (store (store (store .cse4 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store .cse5 .cse6 v_ArrVal_3748) .cse7 v_ArrVal_3750) .cse8 v_ArrVal_3752) .cse9 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse0 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select .cse0 |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) 0)) (forall ((v_ArrVal_3748 Int) (v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3750 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse10 (store (store (store (store (store (store .cse4 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store .cse5 .cse6 v_ArrVal_3748) .cse7 v_ArrVal_3750) .cse8 v_ArrVal_3752) .cse9 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse10 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select .cse10 |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse11) 0)) (forall ((v_ArrVal_3748 Int) (v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3750 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= 0 (select (select (store (let ((.cse12 (store (store (store (store (store (store .cse4 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store .cse5 .cse6 v_ArrVal_3748) .cse7 v_ArrVal_3750) .cse8 v_ArrVal_3752) .cse9 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse12 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select .cse12 |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)))) (forall ((v_ArrVal_3748 Int) (v_ArrVal_3769 Int) (v_ArrVal_3755 Int) (v_ArrVal_3767 Int) (v_ArrVal_3765 Int) (v_ArrVal_3762 Int) (v_ArrVal_3752 Int) (v_ArrVal_3750 Int) (v_ArrVal_3760 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3761 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (v_ArrVal_3757 (Array Int Int)) (v_ArrVal_3758 (Array Int Int)) (v_ArrVal_3759 (Array Int Int))) (= (select (select (store (let ((.cse13 (store (store (store (store (store (store .cse4 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store .cse5 .cse6 v_ArrVal_3748) .cse7 v_ArrVal_3750) .cse8 v_ArrVal_3752) .cse9 v_ArrVal_3755)) |c_~#pre~0.base| v_ArrVal_3757) |c_~#in~0.base| v_ArrVal_3758) |c_~#post~0.base| v_ArrVal_3759) |c_~#in~0.base| v_ArrVal_3760) |c_~#post~0.base| v_ArrVal_3761))) (store .cse13 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select .cse13 |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| v_ArrVal_3762) .cse1 v_ArrVal_3765) .cse2 v_ArrVal_3767) .cse3 v_ArrVal_3769))) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_3756) |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_3782) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse14) 0)))))) is different from false [2023-01-11 18:54:04,946 INFO L321 Elim1Store]: treesize reduction 548, result has 31.6 percent of original size [2023-01-11 18:54:04,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 222 treesize of output 325 [2023-01-11 18:54:05,717 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-11 18:54:05,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30615424266 treesize of output 30593781002 [2023-01-11 18:54:10,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 570538 treesize of output 562282 [2023-01-11 18:54:11,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 570586 treesize of output 562266 [2023-01-11 18:54:12,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25282 treesize of output 24994 [2023-01-11 18:54:13,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8266 treesize of output 7754 [2023-01-11 18:54:21,023 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-11 18:54:21,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73419 treesize of output 72343 [2023-01-11 18:54:22,153 INFO L321 Elim1Store]: treesize reduction 548, result has 31.6 percent of original size [2023-01-11 18:54:22,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 222 treesize of output 325 [2023-01-11 18:54:22,164 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 18:54:22,165 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 18:54:22,195 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-11 18:54:22,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 278122 treesize of output 276586 [2023-01-11 18:54:22,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19266 treesize of output 18978 [2023-01-11 18:54:22,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9708 treesize of output 9580 [2023-01-11 18:54:22,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2002 treesize of output 1874 [2023-01-11 18:54:22,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36890 treesize of output 36378 [2023-01-11 18:54:24,587 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 18:54:24,588 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 18:54:24,588 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 18:54:24,588 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 18:54:24,591 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-01-11 18:54:24,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 9063 treesize of output 8919 [2023-01-11 18:54:25,316 INFO L321 Elim1Store]: treesize reduction 651, result has 18.7 percent of original size [2023-01-11 18:54:25,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 222 treesize of output 222 [2023-01-11 18:54:25,330 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 18:54:25,331 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 18:54:25,399 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-11 18:54:25,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47480931 treesize of output 47226979 [2023-01-11 18:54:25,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36101 treesize of output 35589 [2023-01-11 18:54:25,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2798 treesize of output 2750 [2023-01-11 18:54:26,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2002 treesize of output 1874 [2023-01-11 18:54:26,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9346 treesize of output 9218 [2023-01-11 18:54:27,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 13380 treesize of output 13172 [2023-01-11 18:54:27,993 INFO L321 Elim1Store]: treesize reduction 720, result has 10.1 percent of original size [2023-01-11 18:54:27,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 222 treesize of output 153 [2023-01-11 18:54:28,002 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 18:54:28,003 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 18:54:28,003 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 18:54:28,023 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-11 18:54:28,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15294 treesize of output 15022 [2023-01-11 18:54:28,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9497 treesize of output 9369 [2023-01-11 18:54:28,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 835 treesize of output 771 [2023-01-11 18:54:28,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35943 treesize of output 35431 [2023-01-11 18:54:28,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 709 treesize of output 705 [2023-01-11 18:54:28,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-01-11 18:54:40,451 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-11 18:54:40,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 59 [2023-01-11 18:54:40,473 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-11 18:54:40,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16515 treesize of output 16261 [2023-01-11 18:54:40,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 244 treesize of output 242 [2023-01-11 18:54:40,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 242 treesize of output 234 [2023-01-11 18:54:40,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 230 [2023-01-11 18:54:40,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 214 [2023-01-11 18:54:48,699 INFO L321 Elim1Store]: treesize reduction 108, result has 25.5 percent of original size [2023-01-11 18:54:48,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 61 treesize of output 83 [2023-01-11 18:54:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2023-01-11 18:54:48,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415989285] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-11 18:54:48,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-11 18:54:48,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 41, 52] total 128 [2023-01-11 18:54:48,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757800030] [2023-01-11 18:54:48,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-11 18:54:48,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 129 states [2023-01-11 18:54:48,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 18:54:48,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2023-01-11 18:54:48,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=947, Invalid=12047, Unknown=398, NotChecked=3120, Total=16512 [2023-01-11 18:54:48,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:54:48,954 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 18:54:48,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 129 states, 128 states have (on average 5.3125) internal successors, (680), 129 states have internal predecessors, (680), 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-01-11 18:54:48,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:54:48,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:54:48,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-01-11 18:54:48,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-11 18:54:48,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-01-11 18:54:48,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-11 18:54:48,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-01-11 18:54:48,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 18:55:57,753 WARN L222 SmtUtils]: Spent 15.63s on a formula simplification. DAG size of input: 260 DAG size of output: 202 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-11 18:56:00,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-11 18:56:04,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-11 18:56:06,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-11 18:56:09,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-11 18:56:11,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-11 18:56:14,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-11 18:56:34,866 WARN L222 SmtUtils]: Spent 18.85s on a formula simplification. DAG size of input: 260 DAG size of output: 202 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-11 18:56:36,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-11 18:56:40,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-11 18:56:42,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-11 18:56:45,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-11 18:56:48,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-11 18:56:52,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-11 18:56:55,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-11 18:56:57,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-11 18:56:59,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-11 18:57:02,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-11 18:57:27,237 WARN L222 SmtUtils]: Spent 22.02s on a formula simplification. DAG size of input: 280 DAG size of output: 207 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-11 18:57:42,867 WARN L222 SmtUtils]: Spent 6.84s on a formula simplification. DAG size of input: 300 DAG size of output: 210 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-11 18:58:38,684 WARN L222 SmtUtils]: Spent 17.61s on a formula simplification. DAG size of input: 277 DAG size of output: 193 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-11 18:59:21,584 WARN L222 SmtUtils]: Spent 42.09s on a formula simplification. DAG size of input: 286 DAG size of output: 203 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-11 18:59:23,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-11 18:59:25,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-11 18:59:27,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-11 18:59:30,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-11 18:59:32,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-11 18:59:34,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-11 18:59:36,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-11 18:59:45,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-01-11 19:00:00,632 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-11 19:00:00,632 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-11 19:00:00,632 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-11 19:00:00,632 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-11 19:00:00,632 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-11 19:00:00,632 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-11 19:00:00,632 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-11 19:00:00,632 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-11 19:00:00,632 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-11 19:00:00,632 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-11 19:00:01,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Forceful destruction successful, exit code 0 [2023-01-11 19:00:01,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Ended with exit code 0 [2023-01-11 19:00:01,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Forceful destruction successful, exit code 0 [2023-01-11 19:00:01,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Forceful destruction successful, exit code 0 [2023-01-11 19:00:01,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Ended with exit code 0 [2023-01-11 19:00:01,681 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 [2023-01-11 19:00:01,681 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 [2023-01-11 19:00:01,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-01-11 19:00:01,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Ended with exit code 0 [2023-01-11 19:00:01,834 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-01-11 19:00:01,928 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 137 [2023-01-11 19:00:01,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-01-11 19:00:01,930 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:236) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:230) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.SleepMapReduction.computeSuccessorWithBudget(SleepMapReduction.java:186) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.SleepMapReduction.internalSuccessors(SleepMapReduction.java:156) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.next(NestedIterator.java:94) at java.base/java.util.Iterator.forEachRemaining(Iterator.java:133) at java.base/java.util.Spliterators$IteratorSpliterator.forEachRemaining(Spliterators.java:1801) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEachOrdered(ReferencePipeline.java:502) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:235) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.OptimisticBudget.checkIsSuccessful(OptimisticBudget.java:162) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.OptimisticBudget.isSuccessful(OptimisticBudget.java:151) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.OptimisticBudget.computeBudget(OptimisticBudget.java:130) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.CachedBudget.computeBudget(CachedBudget.java:69) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.SleepMapReduction.internalSuccessors(SleepMapReduction.java:156) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at java.base/java.lang.Iterable.spliterator(Iterable.java:101) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:234) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:130) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.applyInternal(PartialOrderReductionFacade.java:355) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:327) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-01-11 19:00:01,932 INFO L158 Benchmark]: Toolchain (without parser) took 837925.83ms. Allocated memory was 179.3MB in the beginning and 1.1GB in the end (delta: 912.3MB). Free memory was 129.8MB in the beginning and 711.8MB in the end (delta: -582.0MB). Peak memory consumption was 332.1MB. Max. memory is 8.0GB. [2023-01-11 19:00:01,933 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory is still 130.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-01-11 19:00:01,933 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.86ms. Allocated memory is still 179.3MB. Free memory was 129.8MB in the beginning and 104.7MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-01-11 19:00:01,933 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.80ms. Allocated memory is still 179.3MB. Free memory was 104.7MB in the beginning and 97.3MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-01-11 19:00:01,933 INFO L158 Benchmark]: Boogie Preprocessor took 113.35ms. Allocated memory is still 179.3MB. Free memory was 97.3MB in the beginning and 89.2MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-01-11 19:00:01,933 INFO L158 Benchmark]: RCFGBuilder took 1274.97ms. Allocated memory was 179.3MB in the beginning and 267.4MB in the end (delta: 88.1MB). Free memory was 89.2MB in the beginning and 161.8MB in the end (delta: -72.6MB). Peak memory consumption was 17.0MB. Max. memory is 8.0GB. [2023-01-11 19:00:01,934 INFO L158 Benchmark]: TraceAbstraction took 835986.76ms. Allocated memory was 267.4MB in the beginning and 1.1GB in the end (delta: 824.2MB). Free memory was 161.3MB in the beginning and 711.8MB in the end (delta: -550.5MB). Peak memory consumption was 273.2MB. Max. memory is 8.0GB. [2023-01-11 19:00:01,934 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 179.3MB. Free memory is still 130.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 479.86ms. Allocated memory is still 179.3MB. Free memory was 129.8MB in the beginning and 104.7MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.80ms. Allocated memory is still 179.3MB. Free memory was 104.7MB in the beginning and 97.3MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 113.35ms. Allocated memory is still 179.3MB. Free memory was 97.3MB in the beginning and 89.2MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 1274.97ms. Allocated memory was 179.3MB in the beginning and 267.4MB in the end (delta: 88.1MB). Free memory was 89.2MB in the beginning and 161.8MB in the end (delta: -72.6MB). Peak memory consumption was 17.0MB. Max. memory is 8.0GB. * TraceAbstraction took 835986.76ms. Allocated memory was 267.4MB in the beginning and 1.1GB in the end (delta: 824.2MB). Free memory was 161.3MB in the beginning and 711.8MB in the end (delta: -550.5MB). Peak memory consumption was 273.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 1, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 3, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 1 - StatisticsResult: Traversal Statistics Data States: 42, Transitions: 41, Traversal time: 54009319.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: -1 - StatisticsResult: Traversal Statistics Data States: 61, Transitions: 62, Traversal time: 85936116.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: -1 - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 57, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 4, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 57, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 10, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 57, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 21, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 57, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 37, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 57, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 57, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 10 - StatisticsResult: Traversal Statistics Data States: 75, Transitions: 75, Traversal time: 42160370.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: -1 - StatisticsResult: Traversal Statistics Data States: 75, Transitions: 76, Traversal time: 16637160.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: -1 - StatisticsResult: Traversal Statistics Data States: 102, Transitions: 103, Traversal time: 57134107.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: -1 - StatisticsResult: Traversal Statistics Data States: 104, Transitions: 105, Traversal time: 61922738.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: -1 - StatisticsResult: Traversal Statistics Data States: 103, Transitions: 110, Traversal time: 36176735.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: -1 - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 1, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 3, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 1 - StatisticsResult: Traversal Statistics Data States: 50, Transitions: 49, Traversal time: 20057459.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: -1 - StatisticsResult: Traversal Statistics Data States: 61, Transitions: 62, Traversal time: 47223065.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: -1 - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 57, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 4, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 57, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 10, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 57, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 21, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 57, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 37, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 57, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 57, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 10 - StatisticsResult: Traversal Statistics Data States: 83, Transitions: 83, Traversal time: 26152949.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: -1 - StatisticsResult: Traversal Statistics Data States: 83, Transitions: 84, Traversal time: 18851544.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: -1 - StatisticsResult: Traversal Statistics Data States: 110, Transitions: 111, Traversal time: 48665249.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: -1 - StatisticsResult: Traversal Statistics Data States: 112, Transitions: 113, Traversal time: 59948302.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: -1 - StatisticsResult: Traversal Statistics Data States: 111, Transitions: 118, Traversal time: 56633582.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: -1 - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 1, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 3, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 1 - StatisticsResult: Traversal Statistics Data States: 58, Transitions: 57, Traversal time: 19305921.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: -1 - StatisticsResult: Traversal Statistics Data States: 61, Transitions: 62, Traversal time: 42212680.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: -1 - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 69, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 5, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 69, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 14, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 69, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 28, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 69, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 47, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 69, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 69, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 14 - StatisticsResult: Traversal Statistics Data States: 98, Transitions: 98, Traversal time: 25643750.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: -1 - StatisticsResult: Traversal Statistics Data States: 98, Transitions: 100, Traversal time: 4362882.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: -1 - StatisticsResult: Traversal Statistics Data States: 125, Transitions: 127, Traversal time: 62236905.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: -1 - StatisticsResult: Traversal Statistics Data States: 127, Transitions: 129, Traversal time: 56263489.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: -1 - StatisticsResult: Traversal Statistics Data States: 126, Transitions: 134, Traversal time: 44574825.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: -1 - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 69, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 5, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 69, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 14, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 69, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 28, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 69, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 47, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 69, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 69, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 14 - StatisticsResult: Traversal Statistics Data States: 106, Transitions: 106, Traversal time: 21354458.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: -1 - StatisticsResult: Traversal Statistics Data States: 106, Transitions: 108, Traversal time: 4334418.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: -1 - StatisticsResult: Traversal Statistics Data States: 133, Transitions: 135, Traversal time: 40338724.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: -1 - StatisticsResult: Traversal Statistics Data States: 135, Transitions: 137, Traversal time: 51227747.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: -1 - StatisticsResult: Traversal Statistics Data States: 134, Transitions: 142, Traversal time: 77988743.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: -1 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown