./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/no-data-race.prp --file /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version efd9311c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/TaipanReach.xml -i /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i -s /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UTaipan-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 654ba073723c5bebcf706552b3cd58bc95cc07bc71a7e60391f80a16de89dbcb --- Real Ultimate output --- This is Ultimate 0.2.2-dev-efd9311-m [2022-04-18 18:59:47,803 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-18 18:59:47,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-18 18:59:47,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-18 18:59:47,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-18 18:59:47,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-18 18:59:47,841 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-18 18:59:47,845 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-18 18:59:47,847 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-18 18:59:47,851 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-18 18:59:47,852 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-18 18:59:47,854 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-18 18:59:47,854 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-18 18:59:47,855 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-18 18:59:47,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-18 18:59:47,858 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-18 18:59:47,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-18 18:59:47,861 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-18 18:59:47,864 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-18 18:59:47,867 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-18 18:59:47,869 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-18 18:59:47,869 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-18 18:59:47,870 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-18 18:59:47,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-18 18:59:47,872 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-18 18:59:47,875 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-18 18:59:47,875 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-18 18:59:47,875 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-18 18:59:47,876 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-18 18:59:47,876 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-18 18:59:47,877 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-18 18:59:47,877 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-18 18:59:47,879 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-18 18:59:47,879 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-18 18:59:47,880 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-18 18:59:47,880 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-18 18:59:47,880 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-18 18:59:47,881 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-18 18:59:47,881 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-18 18:59:47,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-18 18:59:47,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-18 18:59:47,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-18 18:59:47,884 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-04-18 18:59:47,918 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-18 18:59:47,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-18 18:59:47,918 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-18 18:59:47,918 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-18 18:59:47,919 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-18 18:59:47,919 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-18 18:59:47,919 INFO L138 SettingsManager]: * User list type=DISABLED [2022-04-18 18:59:47,919 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-04-18 18:59:47,920 INFO L138 SettingsManager]: * Explicit value domain=true [2022-04-18 18:59:47,920 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-04-18 18:59:47,920 INFO L138 SettingsManager]: * Octagon Domain=false [2022-04-18 18:59:47,921 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-04-18 18:59:47,921 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-04-18 18:59:47,921 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-04-18 18:59:47,921 INFO L138 SettingsManager]: * Interval Domain=false [2022-04-18 18:59:47,921 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-04-18 18:59:47,921 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-04-18 18:59:47,922 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-04-18 18:59:47,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-18 18:59:47,923 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-18 18:59:47,923 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-04-18 18:59:47,923 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-18 18:59:47,923 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-18 18:59:47,923 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-18 18:59:47,923 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-18 18:59:47,923 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-18 18:59:47,924 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-18 18:59:47,924 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-04-18 18:59:47,924 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-18 18:59:47,924 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-18 18:59:47,924 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-18 18:59:47,924 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-18 18:59:47,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-18 18:59:47,925 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-18 18:59:47,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 18:59:47,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-18 18:59:47,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-18 18:59:47,925 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-18 18:59:47,926 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-04-18 18:59:47,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-18 18:59:47,926 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-18 18:59:47,926 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-18 18:59:47,926 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-18 18:59:47,926 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/UTaipan-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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UTaipan-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 654ba073723c5bebcf706552b3cd58bc95cc07bc71a7e60391f80a16de89dbcb [2022-04-18 18:59:48,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-18 18:59:48,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-18 18:59:48,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-18 18:59:48,097 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-18 18:59:48,097 INFO L275 PluginConnector]: CDTParser initialized [2022-04-18 18:59:48,098 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i [2022-04-18 18:59:48,147 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/bc325ccc3/0cd036c3585348a5bf8c6842a9e84cdd/FLAG6ef5689e0 [2022-04-18 18:59:48,508 INFO L306 CDTParser]: Found 1 translation units. [2022-04-18 18:59:48,509 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i [2022-04-18 18:59:48,523 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/bc325ccc3/0cd036c3585348a5bf8c6842a9e84cdd/FLAG6ef5689e0 [2022-04-18 18:59:48,888 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/bc325ccc3/0cd036c3585348a5bf8c6842a9e84cdd [2022-04-18 18:59:48,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-18 18:59:48,892 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-04-18 18:59:48,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-18 18:59:48,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-18 18:59:48,898 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-18 18:59:48,898 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 06:59:48" (1/1) ... [2022-04-18 18:59:48,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@296323ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:59:48, skipping insertion in model container [2022-04-18 18:59:48,899 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 06:59:48" (1/1) ... [2022-04-18 18:59:48,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-18 18:59:48,932 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-18 18:59:49,049 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-04-18 18:59:49,129 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[30448,30461] [2022-04-18 18:59:49,143 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[30811,30824] [2022-04-18 18:59:49,163 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[31483,31496] [2022-04-18 18:59:49,163 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[31534,31547] [2022-04-18 18:59:49,165 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[31683,31696] [2022-04-18 18:59:49,167 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[31760,31773] [2022-04-18 18:59:49,168 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[31807,31820] [2022-04-18 18:59:49,169 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[31916,31929] [2022-04-18 18:59:49,171 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[32035,32048] [2022-04-18 18:59:49,173 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[32083,32096] [2022-04-18 18:59:49,174 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[32160,32173] [2022-04-18 18:59:49,180 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[32286,32299] [2022-04-18 18:59:49,185 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[32897,32910] [2022-04-18 18:59:49,185 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[32974,32987] [2022-04-18 18:59:49,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 18:59:49,192 INFO L203 MainTranslator]: Completed pre-run [2022-04-18 18:59:49,209 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-04-18 18:59:49,225 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[30448,30461] [2022-04-18 18:59:49,234 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[30811,30824] [2022-04-18 18:59:49,238 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[31483,31496] [2022-04-18 18:59:49,241 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[31534,31547] [2022-04-18 18:59:49,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[31683,31696] [2022-04-18 18:59:49,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[31760,31773] [2022-04-18 18:59:49,249 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[31807,31820] [2022-04-18 18:59:49,251 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[31916,31929] [2022-04-18 18:59:49,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[32035,32048] [2022-04-18 18:59:49,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[32083,32096] [2022-04-18 18:59:49,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[32160,32173] [2022-04-18 18:59:49,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[32286,32299] [2022-04-18 18:59:49,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[32897,32910] [2022-04-18 18:59:49,268 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_twice_2t.i[32974,32987] [2022-04-18 18:59:49,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 18:59:49,297 INFO L208 MainTranslator]: Completed translation [2022-04-18 18:59:49,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:59:49 WrapperNode [2022-04-18 18:59:49,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-18 18:59:49,299 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-04-18 18:59:49,299 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-04-18 18:59:49,299 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-04-18 18:59:49,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:59:49" (1/1) ... [2022-04-18 18:59:49,330 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:59:49" (1/1) ... [2022-04-18 18:59:49,374 INFO L137 Inliner]: procedures = 174, calls = 73, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 805 [2022-04-18 18:59:49,374 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-04-18 18:59:49,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-18 18:59:49,375 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-18 18:59:49,375 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-18 18:59:49,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:59:49" (1/1) ... [2022-04-18 18:59:49,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:59:49" (1/1) ... [2022-04-18 18:59:49,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:59:49" (1/1) ... [2022-04-18 18:59:49,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:59:49" (1/1) ... [2022-04-18 18:59:49,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:59:49" (1/1) ... [2022-04-18 18:59:49,441 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:59:49" (1/1) ... [2022-04-18 18:59:49,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:59:49" (1/1) ... [2022-04-18 18:59:49,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-18 18:59:49,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-18 18:59:49,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-18 18:59:49,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-18 18:59:49,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:59:49" (1/1) ... [2022-04-18 18:59:49,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 18:59:49,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 18:59:49,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-18 18:59:49,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-18 18:59:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-18 18:59:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-18 18:59:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-04-18 18:59:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure worker_fn [2022-04-18 18:59:49,542 INFO L138 BoogieDeclarations]: Found implementation of procedure worker_fn [2022-04-18 18:59:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-18 18:59:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-18 18:59:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-18 18:59:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-18 18:59:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-18 18:59:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-18 18:59:49,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-18 18:59:49,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-18 18:59:49,545 WARN L208 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-04-18 18:59:49,701 INFO L234 CfgBuilder]: Building ICFG [2022-04-18 18:59:49,702 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-18 18:59:50,478 INFO L275 CfgBuilder]: Performing block encoding [2022-04-18 18:59:50,491 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-18 18:59:50,491 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-04-18 18:59:50,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 06:59:50 BoogieIcfgContainer [2022-04-18 18:59:50,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-18 18:59:50,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-18 18:59:50,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-18 18:59:50,499 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-18 18:59:50,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 06:59:48" (1/3) ... [2022-04-18 18:59:50,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69967f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 06:59:50, skipping insertion in model container [2022-04-18 18:59:50,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:59:49" (2/3) ... [2022-04-18 18:59:50,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69967f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 06:59:50, skipping insertion in model container [2022-04-18 18:59:50,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 06:59:50" (3/3) ... [2022-04-18 18:59:50,501 INFO L111 eAbstractionObserver]: Analyzing ICFG one_time_barrier_twice_2t.i [2022-04-18 18:59:50,505 WARN L147 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-04-18 18:59:50,505 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-18 18:59:50,505 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 78 error locations. [2022-04-18 18:59:50,505 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-04-18 18:59:50,644 INFO L135 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-04-18 18:59:50,687 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-18 18:59:50,692 INFO L340 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=FINITE_AUTOMATA, 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 [2022-04-18 18:59:50,693 INFO L341 AbstractCegarLoop]: Starting to check reachability of 113 error locations. [2022-04-18 18:59:50,738 INFO L116 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-04-18 18:59:50,747 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 868 places, 928 transitions, 1864 flow [2022-04-18 18:59:50,750 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 868 places, 928 transitions, 1864 flow [2022-04-18 18:59:50,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 868 places, 928 transitions, 1864 flow [2022-04-18 18:59:51,095 INFO L129 PetriNetUnfolder]: 95/1352 cut-off events. [2022-04-18 18:59:51,096 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-04-18 18:59:51,121 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1358 conditions, 1352 events. 95/1352 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 4543 event pairs, 0 based on Foata normal form. 0/1139 useless extension candidates. Maximal degree in co-relation 794. Up to 4 conditions per place. [2022-04-18 18:59:51,207 INFO L116 LiptonReduction]: Number of co-enabled transitions 313900 [2022-04-18 19:00:32,714 WARN L232 SmtUtils]: Spent 21.53s on a formula simplification. DAG size of input: 153 DAG size of output: 151 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-18 19:00:38,823 WARN L232 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 141 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-18 19:01:01,469 WARN L232 SmtUtils]: Spent 22.64s on a formula simplification. DAG size of input: 156 DAG size of output: 154 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-18 19:01:07,996 WARN L232 SmtUtils]: Spent 6.53s on a formula simplification that was a NOOP. DAG size: 144 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-18 19:01:35,616 WARN L232 SmtUtils]: Spent 25.16s on a formula simplification that was a NOOP. DAG size: 182 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-18 19:01:51,811 WARN L232 SmtUtils]: Spent 16.19s on a formula simplification that was a NOOP. DAG size: 162 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-18 19:02:20,282 WARN L232 SmtUtils]: Spent 28.47s on a formula simplification that was a NOOP. DAG size: 188 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-18 19:02:36,352 WARN L232 SmtUtils]: Spent 16.07s on a formula simplification that was a NOOP. DAG size: 168 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-18 19:02:59,747 WARN L232 SmtUtils]: Spent 15.14s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-18 19:03:14,773 WARN L232 SmtUtils]: Spent 15.03s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-18 19:03:53,843 WARN L232 SmtUtils]: Spent 39.07s on a formula simplification. DAG size of input: 176 DAG size of output: 174 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-18 19:04:12,361 WARN L232 SmtUtils]: Spent 18.52s on a formula simplification that was a NOOP. DAG size: 174 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-18 19:04:15,769 INFO L131 LiptonReduction]: Checked pairs total: 5119439 [2022-04-18 19:04:15,769 INFO L133 LiptonReduction]: Total number of compositions: 687 [2022-04-18 19:04:15,775 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 439 places, 473 transitions, 954 flow [2022-04-18 19:04:16,606 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 45722 states, 44278 states have (on average 2.2197931252540766) internal successors, (98288), 45721 states have internal predecessors, (98288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:16,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 45722 states, 44278 states have (on average 2.2197931252540766) internal successors, (98288), 45721 states have internal predecessors, (98288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:16,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-04-18 19:04:16,670 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:04:16,671 INFO L499 BasicCegarLoop]: trace histogram [1, 1] [2022-04-18 19:04:16,671 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-04-18 19:04:16,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:04:16,691 INFO L85 PathProgramCache]: Analyzing trace with hash 100866, now seen corresponding path program 1 times [2022-04-18 19:04:16,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:04:16,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171234901] [2022-04-18 19:04:16,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:04:16,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:04:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:04:16,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 19:04:16,956 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:04:16,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171234901] [2022-04-18 19:04:16,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171234901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 19:04:16,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 19:04:16,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-04-18 19:04:16,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549619876] [2022-04-18 19:04:16,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 19:04:16,961 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-18 19:04:16,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:04:16,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-18 19:04:16,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-18 19:04:17,022 INFO L87 Difference]: Start difference. First operand has 45722 states, 44278 states have (on average 2.2197931252540766) internal successors, (98288), 45721 states have internal predecessors, (98288), 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) Second operand has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:17,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:04:17,989 INFO L93 Difference]: Finished difference Result 45715 states and 94411 transitions. [2022-04-18 19:04:17,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 19:04:17,990 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2022-04-18 19:04:17,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:04:18,225 INFO L225 Difference]: With dead ends: 45715 [2022-04-18 19:04:18,225 INFO L226 Difference]: Without dead ends: 45713 [2022-04-18 19:04:18,226 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-18 19:04:18,228 INFO L913 BasicCegarLoop]: 304 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-18 19:04:18,228 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 304 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-18 19:04:18,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45713 states. [2022-04-18 19:04:19,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45713 to 45713. [2022-04-18 19:04:19,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45713 states, 44278 states have (on average 2.132164957766837) internal successors, (94408), 45712 states have internal predecessors, (94408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:19,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45713 states to 45713 states and 94408 transitions. [2022-04-18 19:04:19,876 INFO L78 Accepts]: Start accepts. Automaton has 45713 states and 94408 transitions. Word has length 2 [2022-04-18 19:04:19,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:04:19,877 INFO L478 AbstractCegarLoop]: Abstraction has 45713 states and 94408 transitions. [2022-04-18 19:04:19,877 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:19,877 INFO L276 IsEmpty]: Start isEmpty. Operand 45713 states and 94408 transitions. [2022-04-18 19:04:19,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-04-18 19:04:19,877 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:04:19,878 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2022-04-18 19:04:19,878 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-18 19:04:19,878 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-04-18 19:04:19,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:04:19,879 INFO L85 PathProgramCache]: Analyzing trace with hash 240544490, now seen corresponding path program 1 times [2022-04-18 19:04:19,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:04:19,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163977087] [2022-04-18 19:04:19,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:04:19,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:04:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:04:19,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 19:04:19,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:04:19,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163977087] [2022-04-18 19:04:19,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163977087] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 19:04:19,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 19:04:19,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 19:04:19,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143375241] [2022-04-18 19:04:19,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 19:04:19,963 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 19:04:19,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:04:19,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 19:04:19,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:04:19,964 INFO L87 Difference]: Start difference. First operand 45713 states and 94408 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:21,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:04:21,312 INFO L93 Difference]: Finished difference Result 45714 states and 94409 transitions. [2022-04-18 19:04:21,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 19:04:21,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Word has length 7 [2022-04-18 19:04:21,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:04:21,425 INFO L225 Difference]: With dead ends: 45714 [2022-04-18 19:04:21,426 INFO L226 Difference]: Without dead ends: 45714 [2022-04-18 19:04:21,426 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:04:21,426 INFO L913 BasicCegarLoop]: 304 mSDtfsCounter, 0 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-18 19:04:21,427 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 608 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-18 19:04:21,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45714 states. [2022-04-18 19:04:22,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45714 to 45714. [2022-04-18 19:04:22,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45714 states, 44279 states have (on average 2.1321393888750877) internal successors, (94409), 45713 states have internal predecessors, (94409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:22,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45714 states to 45714 states and 94409 transitions. [2022-04-18 19:04:22,465 INFO L78 Accepts]: Start accepts. Automaton has 45714 states and 94409 transitions. Word has length 7 [2022-04-18 19:04:22,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:04:22,465 INFO L478 AbstractCegarLoop]: Abstraction has 45714 states and 94409 transitions. [2022-04-18 19:04:22,465 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:22,465 INFO L276 IsEmpty]: Start isEmpty. Operand 45714 states and 94409 transitions. [2022-04-18 19:04:22,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-04-18 19:04:22,467 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:04:22,467 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-04-18 19:04:22,467 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-18 19:04:22,467 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-04-18 19:04:22,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:04:22,468 INFO L85 PathProgramCache]: Analyzing trace with hash 2090556188, now seen corresponding path program 1 times [2022-04-18 19:04:22,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:04:22,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289843658] [2022-04-18 19:04:22,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:04:22,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:04:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:04:22,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 19:04:22,545 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:04:22,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289843658] [2022-04-18 19:04:22,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289843658] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 19:04:22,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570501024] [2022-04-18 19:04:22,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:04:22,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:04:22,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 19:04:22,550 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 19:04:22,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-18 19:04:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:04:22,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-18 19:04:22,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 19:04:22,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 19:04:22,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 19:04:22,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 19:04:22,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570501024] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 19:04:22,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [881220240] [2022-04-18 19:04:22,830 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2022-04-18 19:04:22,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 19:04:22,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-04-18 19:04:22,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980122256] [2022-04-18 19:04:22,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 19:04:22,832 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-18 19:04:22,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:04:22,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-18 19:04:22,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-18 19:04:22,833 INFO L87 Difference]: Start difference. First operand 45714 states and 94409 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:23,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:04:23,861 INFO L93 Difference]: Finished difference Result 45715 states and 94410 transitions. [2022-04-18 19:04:23,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-18 19:04:23,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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) Word has length 8 [2022-04-18 19:04:23,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:04:23,977 INFO L225 Difference]: With dead ends: 45715 [2022-04-18 19:04:23,978 INFO L226 Difference]: Without dead ends: 45715 [2022-04-18 19:04:23,978 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-18 19:04:23,979 INFO L913 BasicCegarLoop]: 304 mSDtfsCounter, 0 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-18 19:04:23,979 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 608 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-18 19:04:24,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45715 states. [2022-04-18 19:04:24,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45715 to 45715. [2022-04-18 19:04:24,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45715 states, 44280 states have (on average 2.1321138211382116) internal successors, (94410), 45714 states have internal predecessors, (94410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:24,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45715 states to 45715 states and 94410 transitions. [2022-04-18 19:04:24,888 INFO L78 Accepts]: Start accepts. Automaton has 45715 states and 94410 transitions. Word has length 8 [2022-04-18 19:04:24,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:04:24,888 INFO L478 AbstractCegarLoop]: Abstraction has 45715 states and 94410 transitions. [2022-04-18 19:04:24,889 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 45715 states and 94410 transitions. [2022-04-18 19:04:24,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-18 19:04:24,889 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:04:24,889 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2022-04-18 19:04:24,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-18 19:04:25,091 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:04:25,092 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-04-18 19:04:25,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:04:25,093 INFO L85 PathProgramCache]: Analyzing trace with hash -688623318, now seen corresponding path program 2 times [2022-04-18 19:04:25,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:04:25,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193521736] [2022-04-18 19:04:25,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:04:25,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:04:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:04:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:04:25,202 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:04:25,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193521736] [2022-04-18 19:04:25,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193521736] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 19:04:25,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874454989] [2022-04-18 19:04:25,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 19:04:25,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:04:25,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 19:04:25,204 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 19:04:25,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-18 19:04:25,679 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-18 19:04:25,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 19:04:25,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-18 19:04:25,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 19:04:25,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:04:25,704 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 19:04:25,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874454989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 19:04:25,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-18 19:04:25,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-04-18 19:04:25,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911668326] [2022-04-18 19:04:25,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 19:04:25,705 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-18 19:04:25,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:04:25,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-18 19:04:25,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-18 19:04:25,705 INFO L87 Difference]: Start difference. First operand 45715 states and 94410 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:26,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:04:26,774 INFO L93 Difference]: Finished difference Result 45307 states and 93580 transitions. [2022-04-18 19:04:26,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-18 19:04:26,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) Word has length 9 [2022-04-18 19:04:26,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:04:27,039 INFO L225 Difference]: With dead ends: 45307 [2022-04-18 19:04:27,040 INFO L226 Difference]: Without dead ends: 45307 [2022-04-18 19:04:27,040 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-18 19:04:27,042 INFO L913 BasicCegarLoop]: 450 mSDtfsCounter, 651 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-18 19:04:27,043 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [651 Valid, 597 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-18 19:04:27,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45307 states. [2022-04-18 19:04:27,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45307 to 45307. [2022-04-18 19:04:27,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45307 states, 43907 states have (on average 2.131323023663653) internal successors, (93580), 45306 states have internal predecessors, (93580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:27,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45307 states to 45307 states and 93580 transitions. [2022-04-18 19:04:27,762 INFO L78 Accepts]: Start accepts. Automaton has 45307 states and 93580 transitions. Word has length 9 [2022-04-18 19:04:27,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:04:27,762 INFO L478 AbstractCegarLoop]: Abstraction has 45307 states and 93580 transitions. [2022-04-18 19:04:27,762 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:27,762 INFO L276 IsEmpty]: Start isEmpty. Operand 45307 states and 93580 transitions. [2022-04-18 19:04:27,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-04-18 19:04:27,763 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:04:27,763 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:04:27,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-18 19:04:27,965 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:04:27,966 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-04-18 19:04:27,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:04:27,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1115032111, now seen corresponding path program 1 times [2022-04-18 19:04:27,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:04:27,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934475551] [2022-04-18 19:04:27,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:04:27,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:04:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:04:28,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:04:28,035 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:04:28,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934475551] [2022-04-18 19:04:28,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934475551] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 19:04:28,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 19:04:28,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-18 19:04:28,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524312956] [2022-04-18 19:04:28,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 19:04:28,036 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 19:04:28,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:04:28,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 19:04:28,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:04:28,037 INFO L87 Difference]: Start difference. First operand 45307 states and 93580 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:28,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:04:28,906 INFO L93 Difference]: Finished difference Result 45105 states and 93369 transitions. [2022-04-18 19:04:28,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 19:04:28,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 10 [2022-04-18 19:04:28,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:04:28,998 INFO L225 Difference]: With dead ends: 45105 [2022-04-18 19:04:28,999 INFO L226 Difference]: Without dead ends: 45105 [2022-04-18 19:04:28,999 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:04:29,000 INFO L913 BasicCegarLoop]: 303 mSDtfsCounter, 213 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-18 19:04:29,000 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 606 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-18 19:04:29,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45105 states. [2022-04-18 19:04:29,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45105 to 45105. [2022-04-18 19:04:29,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45105 states, 43739 states have (on average 2.1346852923020645) internal successors, (93369), 45104 states have internal predecessors, (93369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:29,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45105 states to 45105 states and 93369 transitions. [2022-04-18 19:04:29,956 INFO L78 Accepts]: Start accepts. Automaton has 45105 states and 93369 transitions. Word has length 10 [2022-04-18 19:04:29,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:04:29,956 INFO L478 AbstractCegarLoop]: Abstraction has 45105 states and 93369 transitions. [2022-04-18 19:04:29,956 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:29,956 INFO L276 IsEmpty]: Start isEmpty. Operand 45105 states and 93369 transitions. [2022-04-18 19:04:29,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-18 19:04:29,957 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:04:29,957 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:04:29,957 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-18 19:04:29,957 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-04-18 19:04:29,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:04:29,959 INFO L85 PathProgramCache]: Analyzing trace with hash -585424511, now seen corresponding path program 1 times [2022-04-18 19:04:29,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:04:29,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766769176] [2022-04-18 19:04:29,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:04:29,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:04:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:04:30,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:04:30,054 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:04:30,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766769176] [2022-04-18 19:04:30,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766769176] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 19:04:30,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 19:04:30,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 19:04:30,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767556896] [2022-04-18 19:04:30,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 19:04:30,055 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 19:04:30,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:04:30,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 19:04:30,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 19:04:30,056 INFO L87 Difference]: Start difference. First operand 45105 states and 93369 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:33,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:04:33,107 INFO L93 Difference]: Finished difference Result 46361 states and 95929 transitions. [2022-04-18 19:04:33,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 19:04:33,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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) Word has length 12 [2022-04-18 19:04:33,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:04:33,177 INFO L225 Difference]: With dead ends: 46361 [2022-04-18 19:04:33,177 INFO L226 Difference]: Without dead ends: 46361 [2022-04-18 19:04:33,178 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 19:04:33,178 INFO L913 BasicCegarLoop]: 363 mSDtfsCounter, 532 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 2739 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 3081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 2739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-18 19:04:33,178 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [532 Valid, 485 Invalid, 3081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 2739 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-18 19:04:33,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46361 states. [2022-04-18 19:04:33,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46361 to 45939. [2022-04-18 19:04:33,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45939 states, 44574 states have (on average 2.132835285143806) internal successors, (95069), 45938 states have internal predecessors, (95069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:33,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45939 states to 45939 states and 95069 transitions. [2022-04-18 19:04:33,916 INFO L78 Accepts]: Start accepts. Automaton has 45939 states and 95069 transitions. Word has length 12 [2022-04-18 19:04:33,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:04:33,917 INFO L478 AbstractCegarLoop]: Abstraction has 45939 states and 95069 transitions. [2022-04-18 19:04:33,917 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:33,917 INFO L276 IsEmpty]: Start isEmpty. Operand 45939 states and 95069 transitions. [2022-04-18 19:04:33,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-18 19:04:33,918 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:04:33,918 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:04:33,918 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-18 19:04:33,918 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-04-18 19:04:33,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:04:33,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1206137307, now seen corresponding path program 1 times [2022-04-18 19:04:33,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:04:33,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973247710] [2022-04-18 19:04:33,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:04:33,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:04:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:04:34,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-18 19:04:34,015 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:04:34,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973247710] [2022-04-18 19:04:34,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973247710] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 19:04:34,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 19:04:34,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 19:04:34,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618837617] [2022-04-18 19:04:34,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 19:04:34,016 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 19:04:34,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:04:34,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 19:04:34,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 19:04:34,017 INFO L87 Difference]: Start difference. First operand 45939 states and 95069 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:37,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:04:37,046 INFO L93 Difference]: Finished difference Result 47101 states and 97435 transitions. [2022-04-18 19:04:37,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 19:04:37,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) Word has length 13 [2022-04-18 19:04:37,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:04:37,151 INFO L225 Difference]: With dead ends: 47101 [2022-04-18 19:04:37,151 INFO L226 Difference]: Without dead ends: 47101 [2022-04-18 19:04:37,152 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 19:04:37,152 INFO L913 BasicCegarLoop]: 352 mSDtfsCounter, 480 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 2613 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 2931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 2613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-18 19:04:37,152 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [480 Valid, 460 Invalid, 2931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 2613 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-18 19:04:37,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47101 states. [2022-04-18 19:04:37,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47101 to 46711. [2022-04-18 19:04:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46711 states, 45346 states have (on average 2.131191284788074) internal successors, (96641), 46710 states have internal predecessors, (96641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:38,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46711 states to 46711 states and 96641 transitions. [2022-04-18 19:04:38,019 INFO L78 Accepts]: Start accepts. Automaton has 46711 states and 96641 transitions. Word has length 13 [2022-04-18 19:04:38,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:04:38,019 INFO L478 AbstractCegarLoop]: Abstraction has 46711 states and 96641 transitions. [2022-04-18 19:04:38,019 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:38,019 INFO L276 IsEmpty]: Start isEmpty. Operand 46711 states and 96641 transitions. [2022-04-18 19:04:38,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-18 19:04:38,020 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:04:38,020 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:04:38,020 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-18 19:04:38,020 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-04-18 19:04:38,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:04:38,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1506736809, now seen corresponding path program 1 times [2022-04-18 19:04:38,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:04:38,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904004327] [2022-04-18 19:04:38,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:04:38,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:04:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:04:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:04:38,070 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:04:38,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904004327] [2022-04-18 19:04:38,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904004327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 19:04:38,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 19:04:38,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 19:04:38,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072767940] [2022-04-18 19:04:38,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 19:04:38,071 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 19:04:38,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:04:38,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 19:04:38,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:04:38,072 INFO L87 Difference]: Start difference. First operand 46711 states and 96641 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:39,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:04:39,715 INFO L93 Difference]: Finished difference Result 46924 states and 97075 transitions. [2022-04-18 19:04:39,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 19:04:39,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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) Word has length 15 [2022-04-18 19:04:39,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:04:39,816 INFO L225 Difference]: With dead ends: 46924 [2022-04-18 19:04:39,816 INFO L226 Difference]: Without dead ends: 46924 [2022-04-18 19:04:39,816 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:04:39,817 INFO L913 BasicCegarLoop]: 318 mSDtfsCounter, 132 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-18 19:04:39,818 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 347 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-18 19:04:39,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46924 states. [2022-04-18 19:04:40,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46924 to 46924. [2022-04-18 19:04:40,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46924 states, 45559 states have (on average 2.1307535283917556) internal successors, (97075), 46923 states have internal predecessors, (97075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:40,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46924 states to 46924 states and 97075 transitions. [2022-04-18 19:04:40,672 INFO L78 Accepts]: Start accepts. Automaton has 46924 states and 97075 transitions. Word has length 15 [2022-04-18 19:04:40,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:04:40,672 INFO L478 AbstractCegarLoop]: Abstraction has 46924 states and 97075 transitions. [2022-04-18 19:04:40,672 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:40,672 INFO L276 IsEmpty]: Start isEmpty. Operand 46924 states and 97075 transitions. [2022-04-18 19:04:40,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-18 19:04:40,673 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:04:40,673 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:04:40,673 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-18 19:04:40,673 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-04-18 19:04:40,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:04:40,674 INFO L85 PathProgramCache]: Analyzing trace with hash -305345103, now seen corresponding path program 1 times [2022-04-18 19:04:40,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:04:40,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097110392] [2022-04-18 19:04:40,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:04:40,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:04:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:04:40,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-18 19:04:40,725 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:04:40,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097110392] [2022-04-18 19:04:40,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097110392] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 19:04:40,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 19:04:40,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 19:04:40,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278771147] [2022-04-18 19:04:40,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 19:04:40,726 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 19:04:40,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:04:40,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 19:04:40,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:04:40,727 INFO L87 Difference]: Start difference. First operand 46924 states and 97075 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:42,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:04:42,225 INFO L93 Difference]: Finished difference Result 47118 states and 97470 transitions. [2022-04-18 19:04:42,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 19:04:42,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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) Word has length 16 [2022-04-18 19:04:42,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:04:42,318 INFO L225 Difference]: With dead ends: 47118 [2022-04-18 19:04:42,318 INFO L226 Difference]: Without dead ends: 47118 [2022-04-18 19:04:42,318 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:04:42,319 INFO L913 BasicCegarLoop]: 316 mSDtfsCounter, 120 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-18 19:04:42,319 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 343 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-18 19:04:42,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47118 states. [2022-04-18 19:04:43,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47118 to 47118. [2022-04-18 19:04:43,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47118 states, 45754 states have (on average 2.130305547055995) internal successors, (97470), 47117 states have internal predecessors, (97470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:43,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47118 states to 47118 states and 97470 transitions. [2022-04-18 19:04:43,385 INFO L78 Accepts]: Start accepts. Automaton has 47118 states and 97470 transitions. Word has length 16 [2022-04-18 19:04:43,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:04:43,386 INFO L478 AbstractCegarLoop]: Abstraction has 47118 states and 97470 transitions. [2022-04-18 19:04:43,386 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:43,386 INFO L276 IsEmpty]: Start isEmpty. Operand 47118 states and 97470 transitions. [2022-04-18 19:04:43,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-18 19:04:43,386 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:04:43,387 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:04:43,387 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-18 19:04:43,387 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-04-18 19:04:43,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:04:43,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1377850265, now seen corresponding path program 1 times [2022-04-18 19:04:43,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:04:43,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694196099] [2022-04-18 19:04:43,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:04:43,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:04:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:04:43,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:04:43,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:04:43,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694196099] [2022-04-18 19:04:43,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694196099] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 19:04:43,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435601427] [2022-04-18 19:04:43,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:04:43,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:04:43,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 19:04:43,488 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 19:04:43,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-18 19:04:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:04:43,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-18 19:04:43,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 19:04:43,693 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 19:04:43,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 19 [2022-04-18 19:04:43,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 19:04:43,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-04-18 19:04:43,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:04:43,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 19:04:43,839 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1572 (Array Int Int))) (= |c_ULTIMATE.start_worker_fn_#t~nondet18#1| (select (select (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| v_ArrVal_1572) |c_~#pre~0.base|) (+ |c_~#pre~0.offset| |c_ULTIMATE.start_worker_fn_~tid~0#1|)))) is different from false [2022-04-18 19:04:43,847 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1572 (Array Int Int))) (= (select (select (store |c_#race| |c_worker_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_1572) |c_~#pre~0.base|) (+ |c_~#pre~0.offset| |c_ULTIMATE.start_worker_fn_~tid~0#1|)) |c_ULTIMATE.start_worker_fn_#t~nondet18#1|)) is different from false [2022-04-18 19:04:43,858 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 19:04:43,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 22 treesize of output 23 [2022-04-18 19:04:43,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 16 [2022-04-18 19:04:43,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:04:43,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435601427] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 19:04:43,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1698268407] [2022-04-18 19:04:43,888 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2022-04-18 19:04:43,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 19:04:43,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2022-04-18 19:04:43,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683305773] [2022-04-18 19:04:43,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 19:04:43,890 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-18 19:04:43,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:04:43,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-18 19:04:43,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=119, Unknown=2, NotChecked=46, Total=210 [2022-04-18 19:04:43,891 INFO L87 Difference]: Start difference. First operand 47118 states and 97470 transitions. Second operand has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:47,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:04:47,486 INFO L93 Difference]: Finished difference Result 47235 states and 97674 transitions. [2022-04-18 19:04:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-18 19:04:47,487 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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) Word has length 18 [2022-04-18 19:04:47,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:04:47,563 INFO L225 Difference]: With dead ends: 47235 [2022-04-18 19:04:47,564 INFO L226 Difference]: Without dead ends: 47235 [2022-04-18 19:04:47,564 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=186, Unknown=2, NotChecked=62, Total=342 [2022-04-18 19:04:47,564 INFO L913 BasicCegarLoop]: 308 mSDtfsCounter, 1124 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 2331 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 4302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1954 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-18 19:04:47,565 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1124 Valid, 1027 Invalid, 4302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2331 Invalid, 0 Unknown, 1954 Unchecked, 3.3s Time] [2022-04-18 19:04:47,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47235 states. [2022-04-18 19:04:48,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47235 to 47123. [2022-04-18 19:04:48,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47123 states, 45759 states have (on average 2.130291308813567) internal successors, (97480), 47122 states have internal predecessors, (97480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:48,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47123 states to 47123 states and 97480 transitions. [2022-04-18 19:04:48,281 INFO L78 Accepts]: Start accepts. Automaton has 47123 states and 97480 transitions. Word has length 18 [2022-04-18 19:04:48,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:04:48,281 INFO L478 AbstractCegarLoop]: Abstraction has 47123 states and 97480 transitions. [2022-04-18 19:04:48,282 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:48,282 INFO L276 IsEmpty]: Start isEmpty. Operand 47123 states and 97480 transitions. [2022-04-18 19:04:48,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-18 19:04:48,282 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:04:48,282 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:04:48,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-18 19:04:48,484 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-18 19:04:48,484 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-04-18 19:04:48,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:04:48,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1368048065, now seen corresponding path program 2 times [2022-04-18 19:04:48,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:04:48,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756586773] [2022-04-18 19:04:48,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:04:48,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:04:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:04:48,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:04:48,728 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:04:48,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756586773] [2022-04-18 19:04:48,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756586773] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 19:04:48,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42322906] [2022-04-18 19:04:48,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 19:04:48,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:04:48,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 19:04:48,729 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 19:04:48,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-18 19:04:49,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-18 19:04:49,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 19:04:49,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-18 19:04:49,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 19:04:49,562 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 19:04:49,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 19 [2022-04-18 19:04:49,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 19:04:49,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-04-18 19:04:49,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:04:49,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 19:04:49,674 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1874 (Array Int Int))) (= (select (select (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| v_ArrVal_1874) |c_~#pre~0.base|) (+ |c_~#pre~0.offset| |c_ULTIMATE.start_worker_fn_~tid~0#1|)) |c_ULTIMATE.start_worker_fn_#t~nondet18#1|)) is different from false [2022-04-18 19:04:49,681 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 19:04:49,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 22 treesize of output 23 [2022-04-18 19:04:49,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 16 [2022-04-18 19:04:49,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:04:49,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42322906] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 19:04:49,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [563569126] [2022-04-18 19:04:49,709 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2022-04-18 19:04:49,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 19:04:49,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-04-18 19:04:49,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025236470] [2022-04-18 19:04:49,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 19:04:49,710 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-18 19:04:49,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:04:49,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-18 19:04:49,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2022-04-18 19:04:49,711 INFO L87 Difference]: Start difference. First operand 47123 states and 97480 transitions. Second operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:53,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:04:53,415 INFO L93 Difference]: Finished difference Result 47127 states and 97488 transitions. [2022-04-18 19:04:53,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-18 19:04:53,416 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-04-18 19:04:53,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:04:53,503 INFO L225 Difference]: With dead ends: 47127 [2022-04-18 19:04:53,503 INFO L226 Difference]: Without dead ends: 47127 [2022-04-18 19:04:53,503 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=220, Unknown=1, NotChecked=32, Total=342 [2022-04-18 19:04:53,504 INFO L913 BasicCegarLoop]: 436 mSDtfsCounter, 3188 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 2846 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3188 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 3776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 884 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-18 19:04:53,504 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3188 Valid, 956 Invalid, 3776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2846 Invalid, 0 Unknown, 884 Unchecked, 3.5s Time] [2022-04-18 19:04:53,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47127 states. [2022-04-18 19:04:54,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47127 to 47102. [2022-04-18 19:04:54,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47102 states, 45739 states have (on average 2.1303045541004395) internal successors, (97438), 47101 states have internal predecessors, (97438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:54,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47102 states to 47102 states and 97438 transitions. [2022-04-18 19:04:54,226 INFO L78 Accepts]: Start accepts. Automaton has 47102 states and 97438 transitions. Word has length 18 [2022-04-18 19:04:54,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:04:54,226 INFO L478 AbstractCegarLoop]: Abstraction has 47102 states and 97438 transitions. [2022-04-18 19:04:54,226 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:54,226 INFO L276 IsEmpty]: Start isEmpty. Operand 47102 states and 97438 transitions. [2022-04-18 19:04:54,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-18 19:04:54,228 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:04:54,228 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:04:54,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-18 19:04:54,428 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:04:54,428 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-04-18 19:04:54,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:04:54,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1947237113, now seen corresponding path program 1 times [2022-04-18 19:04:54,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:04:54,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132317657] [2022-04-18 19:04:54,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:04:54,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:04:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:04:54,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-18 19:04:54,648 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:04:54,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132317657] [2022-04-18 19:04:54,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132317657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 19:04:54,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 19:04:54,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 19:04:54,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952106707] [2022-04-18 19:04:54,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 19:04:54,650 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-18 19:04:54,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:04:54,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-18 19:04:54,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-18 19:04:54,650 INFO L87 Difference]: Start difference. First operand 47102 states and 97438 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:56,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:04:56,677 INFO L93 Difference]: Finished difference Result 47106 states and 97446 transitions. [2022-04-18 19:04:56,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-18 19:04:56,677 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) Word has length 18 [2022-04-18 19:04:56,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:04:56,756 INFO L225 Difference]: With dead ends: 47106 [2022-04-18 19:04:56,756 INFO L226 Difference]: Without dead ends: 47106 [2022-04-18 19:04:56,756 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-18 19:04:56,756 INFO L913 BasicCegarLoop]: 428 mSDtfsCounter, 1784 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1784 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-18 19:04:56,757 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1784 Valid, 748 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1305 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-18 19:04:56,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47106 states. [2022-04-18 19:04:57,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47106 to 47086. [2022-04-18 19:04:57,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47086 states, 45724 states have (on average 2.1303035604933953) internal successors, (97406), 47085 states have internal predecessors, (97406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:57,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47086 states to 47086 states and 97406 transitions. [2022-04-18 19:04:57,498 INFO L78 Accepts]: Start accepts. Automaton has 47086 states and 97406 transitions. Word has length 18 [2022-04-18 19:04:57,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:04:57,498 INFO L478 AbstractCegarLoop]: Abstraction has 47086 states and 97406 transitions. [2022-04-18 19:04:57,498 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:57,498 INFO L276 IsEmpty]: Start isEmpty. Operand 47086 states and 97406 transitions. [2022-04-18 19:04:57,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-18 19:04:57,498 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:04:57,498 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:04:57,498 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-18 19:04:57,499 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting worker_fnErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-04-18 19:04:57,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:04:57,499 INFO L85 PathProgramCache]: Analyzing trace with hash 519700308, now seen corresponding path program 1 times [2022-04-18 19:04:57,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:04:57,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888290638] [2022-04-18 19:04:57,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:04:57,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:04:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:04:57,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:04:57,535 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:04:57,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888290638] [2022-04-18 19:04:57,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888290638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 19:04:57,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 19:04:57,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 19:04:57,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938457749] [2022-04-18 19:04:57,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 19:04:57,536 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 19:04:57,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:04:57,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 19:04:57,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:04:57,537 INFO L87 Difference]: Start difference. First operand 47086 states and 97406 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:59,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:04:59,207 INFO L93 Difference]: Finished difference Result 48121 states and 99516 transitions. [2022-04-18 19:04:59,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 19:04:59,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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) Word has length 18 [2022-04-18 19:04:59,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:04:59,295 INFO L225 Difference]: With dead ends: 48121 [2022-04-18 19:04:59,296 INFO L226 Difference]: Without dead ends: 48121 [2022-04-18 19:04:59,296 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:04:59,296 INFO L913 BasicCegarLoop]: 316 mSDtfsCounter, 135 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-18 19:04:59,296 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 344 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-18 19:04:59,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48121 states. [2022-04-18 19:04:59,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48121 to 47279. [2022-04-18 19:05:00,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47279 states, 45919 states have (on average 2.129837322241338) internal successors, (97800), 47278 states have internal predecessors, (97800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:05:00,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47279 states to 47279 states and 97800 transitions. [2022-04-18 19:05:00,121 INFO L78 Accepts]: Start accepts. Automaton has 47279 states and 97800 transitions. Word has length 18 [2022-04-18 19:05:00,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:05:00,122 INFO L478 AbstractCegarLoop]: Abstraction has 47279 states and 97800 transitions. [2022-04-18 19:05:00,122 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:05:00,122 INFO L276 IsEmpty]: Start isEmpty. Operand 47279 states and 97800 transitions. [2022-04-18 19:05:00,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-18 19:05:00,122 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:05:00,122 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:05:00,123 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-18 19:05:00,123 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-04-18 19:05:00,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:05:00,123 INFO L85 PathProgramCache]: Analyzing trace with hash 235203680, now seen corresponding path program 1 times [2022-04-18 19:05:00,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:05:00,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110198560] [2022-04-18 19:05:00,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:05:00,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:05:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:05:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-18 19:05:00,176 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:05:00,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110198560] [2022-04-18 19:05:00,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110198560] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 19:05:00,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 19:05:00,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 19:05:00,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587245253] [2022-04-18 19:05:00,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 19:05:00,177 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 19:05:00,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:05:00,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 19:05:00,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:05:00,178 INFO L87 Difference]: Start difference. First operand 47279 states and 97800 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:05:01,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:05:01,440 INFO L93 Difference]: Finished difference Result 48228 states and 99733 transitions. [2022-04-18 19:05:01,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 19:05:01,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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) Word has length 19 [2022-04-18 19:05:01,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:05:01,518 INFO L225 Difference]: With dead ends: 48228 [2022-04-18 19:05:01,519 INFO L226 Difference]: Without dead ends: 48228 [2022-04-18 19:05:01,519 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:05:01,519 INFO L913 BasicCegarLoop]: 313 mSDtfsCounter, 123 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-18 19:05:01,519 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 341 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-18 19:05:01,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48228 states. [2022-04-18 19:05:02,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48228 to 47454. [2022-04-18 19:05:02,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47454 states, 46097 states have (on average 2.1293576588498166) internal successors, (98157), 47453 states have internal predecessors, (98157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:05:02,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47454 states to 47454 states and 98157 transitions. [2022-04-18 19:05:02,322 INFO L78 Accepts]: Start accepts. Automaton has 47454 states and 98157 transitions. Word has length 19 [2022-04-18 19:05:02,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:05:02,322 INFO L478 AbstractCegarLoop]: Abstraction has 47454 states and 98157 transitions. [2022-04-18 19:05:02,323 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:05:02,323 INFO L276 IsEmpty]: Start isEmpty. Operand 47454 states and 98157 transitions. [2022-04-18 19:05:02,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-18 19:05:02,323 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:05:02,323 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:05:02,323 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-18 19:05:02,323 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-04-18 19:05:02,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:05:02,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1467232395, now seen corresponding path program 1 times [2022-04-18 19:05:02,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:05:02,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82678496] [2022-04-18 19:05:02,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:05:02,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:05:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:05:02,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:05:02,641 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:05:02,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82678496] [2022-04-18 19:05:02,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82678496] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 19:05:02,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189611323] [2022-04-18 19:05:02,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:05:02,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:05:02,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 19:05:02,642 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 19:05:02,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-18 19:05:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:05:02,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-18 19:05:02,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 19:05:02,911 INFO L356 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2022-04-18 19:05:02,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 37 [2022-04-18 19:05:03,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-04-18 19:05:03,062 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-18 19:05:03,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-18 19:05:03,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-04-18 19:05:03,123 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-04-18 19:05:03,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2022-04-18 19:05:03,170 INFO L356 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-04-18 19:05:03,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 46 [2022-04-18 19:05:03,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:05:03,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 19:05:03,236 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2632 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2632) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2632 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2632) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:05:03,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:05:03,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189611323] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 19:05:03,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1345102806] [2022-04-18 19:05:03,280 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2022-04-18 19:05:03,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 19:05:03,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2022-04-18 19:05:03,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557954879] [2022-04-18 19:05:03,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 19:05:03,281 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-18 19:05:03,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:05:03,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-18 19:05:03,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=311, Unknown=1, NotChecked=36, Total=420 [2022-04-18 19:05:03,282 INFO L87 Difference]: Start difference. First operand 47454 states and 98157 transitions. Second operand has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:05:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:05:11,624 INFO L93 Difference]: Finished difference Result 49221 states and 101754 transitions. [2022-04-18 19:05:11,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-18 19:05:11,624 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 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) Word has length 21 [2022-04-18 19:05:11,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:05:11,717 INFO L225 Difference]: With dead ends: 49221 [2022-04-18 19:05:11,717 INFO L226 Difference]: Without dead ends: 49221 [2022-04-18 19:05:11,717 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=192, Invalid=621, Unknown=3, NotChecked=54, Total=870 [2022-04-18 19:05:11,717 INFO L913 BasicCegarLoop]: 506 mSDtfsCounter, 2372 mSDsluCounter, 4599 mSDsCounter, 0 mSdLazyCounter, 10282 mSolverCounterSat, 691 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2372 SdHoareTripleChecker+Valid, 2938 SdHoareTripleChecker+Invalid, 13099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 691 IncrementalHoareTripleChecker+Valid, 10282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2126 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-04-18 19:05:11,718 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2372 Valid, 2938 Invalid, 13099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [691 Valid, 10282 Invalid, 0 Unknown, 2126 Unchecked, 7.9s Time] [2022-04-18 19:05:11,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49221 states. [2022-04-18 19:05:12,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49221 to 47471. [2022-04-18 19:05:12,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47471 states, 46114 states have (on average 2.129396712495121) internal successors, (98195), 47470 states have internal predecessors, (98195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:05:12,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47471 states to 47471 states and 98195 transitions. [2022-04-18 19:05:12,461 INFO L78 Accepts]: Start accepts. Automaton has 47471 states and 98195 transitions. Word has length 21 [2022-04-18 19:05:12,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:05:12,461 INFO L478 AbstractCegarLoop]: Abstraction has 47471 states and 98195 transitions. [2022-04-18 19:05:12,461 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:05:12,461 INFO L276 IsEmpty]: Start isEmpty. Operand 47471 states and 98195 transitions. [2022-04-18 19:05:12,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-18 19:05:12,462 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:05:12,462 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:05:12,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-18 19:05:12,662 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,6 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:05:12,662 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-04-18 19:05:12,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:05:12,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1481070795, now seen corresponding path program 2 times [2022-04-18 19:05:12,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:05:12,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954628830] [2022-04-18 19:05:12,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:05:12,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:05:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:05:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:05:12,802 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:05:12,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954628830] [2022-04-18 19:05:12,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954628830] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 19:05:12,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255013636] [2022-04-18 19:05:12,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 19:05:12,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:05:12,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 19:05:12,803 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 19:05:12,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-18 19:05:13,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-18 19:05:13,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 19:05:13,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-18 19:05:13,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 19:05:13,538 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 19:05:13,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 19 [2022-04-18 19:05:13,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-04-18 19:05:13,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:13,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2022-04-18 19:05:13,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:13,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:13,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:13,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-04-18 19:05:13,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 32 [2022-04-18 19:05:13,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:13,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:13,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:13,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:13,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:13,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:13,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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 [2022-04-18 19:05:13,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:05:13,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 19:05:13,857 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2952 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2952) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2952 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2952) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2952 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2952) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:05:13,939 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2952 (Array Int Int))) (= (select (select (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)) |c_~#pre~0.base| v_ArrVal_2952) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2952 (Array Int Int))) (= (let ((.cse0 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse0 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)) |c_~#pre~0.base| v_ArrVal_2952) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse0)) 0))) is different from false [2022-04-18 19:05:13,963 INFO L356 Elim1Store]: treesize reduction 88, result has 26.1 percent of original size [2022-04-18 19:05:13,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 43 [2022-04-18 19:05:13,966 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-04-18 19:05:13,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 32 [2022-04-18 19:05:13,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 19:05:13,988 INFO L356 Elim1Store]: treesize reduction 118, result has 0.8 percent of original size [2022-04-18 19:05:13,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 1 [2022-04-18 19:05:14,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:05:14,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255013636] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 19:05:14,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1793129880] [2022-04-18 19:05:14,014 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2022-04-18 19:05:14,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 19:05:14,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 21 [2022-04-18 19:05:14,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712546745] [2022-04-18 19:05:14,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 19:05:14,015 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-18 19:05:14,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:05:14,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-18 19:05:14,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=328, Unknown=18, NotChecked=78, Total=506 [2022-04-18 19:05:14,015 INFO L87 Difference]: Start difference. First operand 47471 states and 98195 transitions. Second operand has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 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) [2022-04-18 19:05:21,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:05:21,966 INFO L93 Difference]: Finished difference Result 101268 states and 209478 transitions. [2022-04-18 19:05:21,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-18 19:05:21,966 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 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) Word has length 21 [2022-04-18 19:05:21,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:05:22,177 INFO L225 Difference]: With dead ends: 101268 [2022-04-18 19:05:22,177 INFO L226 Difference]: Without dead ends: 101268 [2022-04-18 19:05:22,177 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=227, Invalid=816, Unknown=21, NotChecked=126, Total=1190 [2022-04-18 19:05:22,178 INFO L913 BasicCegarLoop]: 464 mSDtfsCounter, 3312 mSDsluCounter, 4502 mSDsCounter, 0 mSdLazyCounter, 10132 mSolverCounterSat, 884 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3312 SdHoareTripleChecker+Valid, 2693 SdHoareTripleChecker+Invalid, 16219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 884 IncrementalHoareTripleChecker+Valid, 10132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5203 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-04-18 19:05:22,178 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3312 Valid, 2693 Invalid, 16219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [884 Valid, 10132 Invalid, 0 Unknown, 5203 Unchecked, 7.2s Time] [2022-04-18 19:05:22,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101268 states. [2022-04-18 19:05:23,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101268 to 47508. [2022-04-18 19:05:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47508 states, 46151 states have (on average 2.1292929730666725) internal successors, (98269), 47507 states have internal predecessors, (98269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:05:23,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47508 states to 47508 states and 98269 transitions. [2022-04-18 19:05:23,394 INFO L78 Accepts]: Start accepts. Automaton has 47508 states and 98269 transitions. Word has length 21 [2022-04-18 19:05:23,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:05:23,395 INFO L478 AbstractCegarLoop]: Abstraction has 47508 states and 98269 transitions. [2022-04-18 19:05:23,395 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 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) [2022-04-18 19:05:23,395 INFO L276 IsEmpty]: Start isEmpty. Operand 47508 states and 98269 transitions. [2022-04-18 19:05:23,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-18 19:05:23,396 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:05:23,396 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:05:23,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-18 19:05:23,597 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,7 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:05:23,597 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-04-18 19:05:23,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:05:23,597 INFO L85 PathProgramCache]: Analyzing trace with hash -318451710, now seen corresponding path program 1 times [2022-04-18 19:05:23,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:05:23,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892613851] [2022-04-18 19:05:23,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:05:23,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:05:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:05:24,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:05:24,081 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:05:24,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892613851] [2022-04-18 19:05:24,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892613851] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 19:05:24,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856997973] [2022-04-18 19:05:24,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:05:24,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:05:24,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 19:05:24,082 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 19:05:24,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-18 19:05:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:05:24,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 58 conjunts are in the unsatisfiable core [2022-04-18 19:05:24,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 19:05:24,348 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 19:05:24,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 19 [2022-04-18 19:05:24,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 19:05:24,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 19:05:24,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 19:05:24,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 19:05:24,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 19:05:24,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 19:05:24,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 19:05:24,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:24,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 19:05:31,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 52 [2022-04-18 19:05:37,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:05:37,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 19:05:37,092 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3280 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_3280) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) 0)) (forall ((v_ArrVal_3280 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_3280) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) 0)) (forall ((v_ArrVal_3280 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_3280) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11)) 0)) (forall ((v_ArrVal_3280 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_3280) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) 0))) is different from false [2022-04-18 19:05:37,556 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3279 Int) (v_ArrVal_3277 Int) (v_ArrVal_3274 Int) (v_ArrVal_3280 (Array Int Int))) (= (select (select (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3274) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3277) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3279)) |c_~#pre~0.base| v_ArrVal_3280) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11)) 0)) (forall ((v_ArrVal_3279 Int) (v_ArrVal_3277 Int) (v_ArrVal_3274 Int) (v_ArrVal_3280 (Array Int Int))) (= (select (select (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3274) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3277) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3279)) |c_~#pre~0.base| v_ArrVal_3280) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) 0)) (forall ((v_ArrVal_3279 Int) (v_ArrVal_3277 Int) (v_ArrVal_3274 Int) (v_ArrVal_3280 (Array Int Int))) (= (select (select (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3274) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3277) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3279)) |c_~#pre~0.base| v_ArrVal_3280) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) 0)) (forall ((v_ArrVal_3279 Int) (v_ArrVal_3277 Int) (v_ArrVal_3274 Int) (v_ArrVal_3280 (Array Int Int))) (= (select (select (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3274) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3277) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) v_ArrVal_3279)) |c_~#pre~0.base| v_ArrVal_3280) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) 0))) is different from false [2022-04-18 19:05:37,624 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| Int)) (or (and (forall ((v_ArrVal_3279 Int) (v_ArrVal_3277 Int) (v_ArrVal_3274 Int) (v_ArrVal_3280 (Array Int Int))) (= (select (select (store (store |c_#race| |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 8) 0) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 9) v_ArrVal_3274) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 10) v_ArrVal_3277) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 11) v_ArrVal_3279)) |c_~#pre~0.base| v_ArrVal_3280) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11)) 0)) (forall ((v_ArrVal_3279 Int) (v_ArrVal_3277 Int) (v_ArrVal_3274 Int) (v_ArrVal_3280 (Array Int Int))) (= (select (select (store (store |c_#race| |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 8) 0) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 9) v_ArrVal_3274) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 10) v_ArrVal_3277) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 11) v_ArrVal_3279)) |c_~#pre~0.base| v_ArrVal_3280) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) 0)) (forall ((v_ArrVal_3279 Int) (v_ArrVal_3277 Int) (v_ArrVal_3274 Int) (v_ArrVal_3280 (Array Int Int))) (= (select (select (store (store |c_#race| |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 8) 0) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 9) v_ArrVal_3274) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 10) v_ArrVal_3277) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 11) v_ArrVal_3279)) |c_~#pre~0.base| v_ArrVal_3280) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) 0)) (forall ((v_ArrVal_3279 Int) (v_ArrVal_3277 Int) (v_ArrVal_3274 Int) (v_ArrVal_3280 (Array Int Int))) (= 0 (select (select (store (store |c_#race| |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 8) 0) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 9) v_ArrVal_3274) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 10) v_ArrVal_3277) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 11) v_ArrVal_3279)) |c_~#pre~0.base| v_ArrVal_3280) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9))))) (< |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466|))) is different from false [2022-04-18 19:05:37,821 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| Int)) (or (< |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466|) (and (forall ((v_ArrVal_3279 Int) (v_ArrVal_3277 Int) (v_ArrVal_3274 Int) (v_ArrVal_3280 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11))) (select (select (store (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|) .cse1 0)))) (store .cse0 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select .cse0 |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 8) 0) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 9) v_ArrVal_3274) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 10) v_ArrVal_3277) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 11) v_ArrVal_3279))) |c_~#pre~0.base| v_ArrVal_3280) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse1)) 0)) (forall ((v_ArrVal_3279 Int) (v_ArrVal_3277 Int) (v_ArrVal_3274 Int) (v_ArrVal_3280 (Array Int Int))) (= (select (select (store (let ((.cse2 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0)))) (store .cse2 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select .cse2 |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 8) 0) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 9) v_ArrVal_3274) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 10) v_ArrVal_3277) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 11) v_ArrVal_3279))) |c_~#pre~0.base| v_ArrVal_3280) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) 0)) (forall ((v_ArrVal_3279 Int) (v_ArrVal_3277 Int) (v_ArrVal_3274 Int) (v_ArrVal_3280 (Array Int Int))) (= (select (select (store (let ((.cse3 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0)))) (store .cse3 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select .cse3 |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 8) 0) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 9) v_ArrVal_3274) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 10) v_ArrVal_3277) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 11) v_ArrVal_3279))) |c_~#pre~0.base| v_ArrVal_3280) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) 0)) (forall ((v_ArrVal_3279 Int) (v_ArrVal_3277 Int) (v_ArrVal_3274 Int) (v_ArrVal_3280 (Array Int Int))) (= (select (select (store (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0)))) (store .cse4 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select .cse4 |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 8) 0) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 9) v_ArrVal_3274) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 10) v_ArrVal_3277) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 11) v_ArrVal_3279))) |c_~#pre~0.base| v_ArrVal_3280) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) 0))))) is different from false [2022-04-18 19:05:42,679 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:42,680 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:42,680 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:42,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:42,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:42,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:42,990 INFO L356 Elim1Store]: treesize reduction 1230, result has 14.6 percent of original size [2022-04-18 19:05:42,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 223 [2022-04-18 19:05:43,014 INFO L356 Elim1Store]: treesize reduction 132, result has 0.8 percent of original size [2022-04-18 19:05:43,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 206 treesize of output 170 [2022-04-18 19:05:43,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-04-18 19:05:43,100 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,100 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,101 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,102 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,102 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,102 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,103 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,103 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,103 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,103 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,209 INFO L356 Elim1Store]: treesize reduction 880, result has 6.5 percent of original size [2022-04-18 19:05:43,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 73 [2022-04-18 19:05:43,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,214 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,214 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2022-04-18 19:05:43,221 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,223 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,224 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,224 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,377 INFO L356 Elim1Store]: treesize reduction 818, result has 13.1 percent of original size [2022-04-18 19:05:43,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 135 [2022-04-18 19:05:43,381 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,383 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:43,384 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 47 [2022-04-18 19:05:43,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,418 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,418 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,420 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,420 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,420 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,421 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,421 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,421 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:43,475 INFO L356 Elim1Store]: treesize reduction 940, result has 0.1 percent of original size [2022-04-18 19:05:43,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 19:05:43,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:05:43,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856997973] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 19:05:43,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1590134649] [2022-04-18 19:05:43,741 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2022-04-18 19:05:43,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 19:05:43,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 37 [2022-04-18 19:05:43,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157045681] [2022-04-18 19:05:43,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 19:05:43,741 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-18 19:05:43,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:05:43,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-18 19:05:43,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=978, Unknown=47, NotChecked=276, Total=1482 [2022-04-18 19:05:43,742 INFO L87 Difference]: Start difference. First operand 47508 states and 98269 transitions. Second operand has 39 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:05:48,787 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|)) (.cse6 (* (- 1) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#b1~0#1.base| 3)) (forall ((|v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| Int)) (or (< |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466|) (and (forall ((v_ArrVal_3279 Int) (v_ArrVal_3277 Int) (v_ArrVal_3274 Int) (v_ArrVal_3280 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11))) (select (select (store (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|) .cse1 0)))) (store .cse0 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select .cse0 |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 8) 0) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 9) v_ArrVal_3274) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 10) v_ArrVal_3277) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 11) v_ArrVal_3279))) |c_~#pre~0.base| v_ArrVal_3280) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse1)) 0)) (forall ((v_ArrVal_3279 Int) (v_ArrVal_3277 Int) (v_ArrVal_3274 Int) (v_ArrVal_3280 (Array Int Int))) (= (select (select (store (let ((.cse2 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0)))) (store .cse2 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select .cse2 |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 8) 0) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 9) v_ArrVal_3274) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 10) v_ArrVal_3277) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 11) v_ArrVal_3279))) |c_~#pre~0.base| v_ArrVal_3280) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) 0)) (forall ((v_ArrVal_3279 Int) (v_ArrVal_3277 Int) (v_ArrVal_3274 Int) (v_ArrVal_3280 (Array Int Int))) (= (select (select (store (let ((.cse3 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0)))) (store .cse3 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select .cse3 |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 8) 0) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 9) v_ArrVal_3274) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 10) v_ArrVal_3277) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 11) v_ArrVal_3279))) |c_~#pre~0.base| v_ArrVal_3280) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) 0)) (forall ((v_ArrVal_3279 Int) (v_ArrVal_3277 Int) (v_ArrVal_3274 Int) (v_ArrVal_3280 (Array Int Int))) (= (select (select (store (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0)))) (store .cse4 |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select .cse4 |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 8) 0) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 9) v_ArrVal_3274) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 10) v_ArrVal_3277) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 11) v_ArrVal_3279))) |c_~#pre~0.base| v_ArrVal_3280) |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.base| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (= 0 (select .cse5 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8))) (= |c_worker_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_main_~#a~1#1.base|) (= (select .cse5 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) 0) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (= (select .cse5 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) 0) (<= (div (+ .cse6 |c_ULTIMATE.start_worker_fn_~a~0#1.offset| (- 12)) (- 12)) 0) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_ULTIMATE.start_main_~#b2~0#1.base|)) (= |c_~#pre~0.base| 3) (not (= |c_worker_fnThread1of1ForFork0_#in~arg#1.base| 3)) (<= (div (+ .cse6 |c_ULTIMATE.start_main_~#a~1#1.offset|) (- 12)) 0))) is different from false [2022-04-18 19:05:50,808 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|))) (and (= |c_worker_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (= 0 (select .cse0 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8))) (= (select .cse0 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9)) 0) (= (select .cse0 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) 0) (forall ((|v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| Int)) (or (and (forall ((v_ArrVal_3279 Int) (v_ArrVal_3277 Int) (v_ArrVal_3274 Int) (v_ArrVal_3280 (Array Int Int))) (= (select (select (store (store |c_#race| |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 8) 0) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 9) v_ArrVal_3274) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 10) v_ArrVal_3277) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 11) v_ArrVal_3279)) |c_~#pre~0.base| v_ArrVal_3280) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11)) 0)) (forall ((v_ArrVal_3279 Int) (v_ArrVal_3277 Int) (v_ArrVal_3274 Int) (v_ArrVal_3280 (Array Int Int))) (= (select (select (store (store |c_#race| |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 8) 0) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 9) v_ArrVal_3274) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 10) v_ArrVal_3277) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 11) v_ArrVal_3279)) |c_~#pre~0.base| v_ArrVal_3280) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) 0)) (forall ((v_ArrVal_3279 Int) (v_ArrVal_3277 Int) (v_ArrVal_3274 Int) (v_ArrVal_3280 (Array Int Int))) (= (select (select (store (store |c_#race| |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 8) 0) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 9) v_ArrVal_3274) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 10) v_ArrVal_3277) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 11) v_ArrVal_3279)) |c_~#pre~0.base| v_ArrVal_3280) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8)) 0)) (forall ((v_ArrVal_3279 Int) (v_ArrVal_3277 Int) (v_ArrVal_3274 Int) (v_ArrVal_3280 (Array Int Int))) (= 0 (select (select (store (store |c_#race| |c_worker_fnThread1of1ForFork0_#in~arg#1.base| (store (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_#in~arg#1.base|) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 8) 0) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 9) v_ArrVal_3274) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 10) v_ArrVal_3277) (+ |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466| 11) v_ArrVal_3279)) |c_~#pre~0.base| v_ArrVal_3280) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9))))) (< |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| |v_worker_fnThread1of1ForFork0_~a~0#1.offset_4466|))) (<= (div (+ (* (- 1) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset|) |c_ULTIMATE.start_worker_fn_~a~0#1.offset| (- 12)) (- 12)) 0) (= |c_~#pre~0.base| 3) (not (= |c_worker_fnThread1of1ForFork0_#in~arg#1.base| 3)) (= 0 (select .cse0 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11))))) is different from false [2022-04-18 19:05:53,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:05:53,985 INFO L93 Difference]: Finished difference Result 48578 states and 100475 transitions. [2022-04-18 19:05:53,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-18 19:05:53,985 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-04-18 19:05:53,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:05:54,077 INFO L225 Difference]: With dead ends: 48578 [2022-04-18 19:05:54,078 INFO L226 Difference]: Without dead ends: 48578 [2022-04-18 19:05:54,079 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=284, Invalid=1496, Unknown=50, NotChecked=522, Total=2352 [2022-04-18 19:05:54,079 INFO L913 BasicCegarLoop]: 460 mSDtfsCounter, 2830 mSDsluCounter, 3917 mSDsCounter, 0 mSdLazyCounter, 4510 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2830 SdHoareTripleChecker+Valid, 2375 SdHoareTripleChecker+Invalid, 18268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 4510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13400 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-18 19:05:54,079 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2830 Valid, 2375 Invalid, 18268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 4510 Invalid, 0 Unknown, 13400 Unchecked, 5.2s Time] [2022-04-18 19:05:54,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48578 states. [2022-04-18 19:05:54,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48578 to 47519. [2022-04-18 19:05:54,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47519 states, 46162 states have (on average 2.129283826523981) internal successors, (98292), 47518 states have internal predecessors, (98292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:05:54,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47519 states to 47519 states and 98292 transitions. [2022-04-18 19:05:54,960 INFO L78 Accepts]: Start accepts. Automaton has 47519 states and 98292 transitions. Word has length 21 [2022-04-18 19:05:54,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:05:54,961 INFO L478 AbstractCegarLoop]: Abstraction has 47519 states and 98292 transitions. [2022-04-18 19:05:54,961 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:05:54,961 INFO L276 IsEmpty]: Start isEmpty. Operand 47519 states and 98292 transitions. [2022-04-18 19:05:54,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-18 19:05:54,962 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:05:54,962 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:05:54,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-18 19:05:55,163 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-18 19:05:55,164 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-04-18 19:05:55,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:05:55,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1968767544, now seen corresponding path program 2 times [2022-04-18 19:05:55,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:05:55,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82414690] [2022-04-18 19:05:55,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:05:55,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:05:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:05:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:05:55,625 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:05:55,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82414690] [2022-04-18 19:05:55,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82414690] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 19:05:55,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941137504] [2022-04-18 19:05:55,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 19:05:55,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:05:55,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 19:05:55,626 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 19:05:55,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-18 19:05:55,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 19:05:55,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 19:05:55,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-18 19:05:55,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 19:05:55,890 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-04-18 19:05:55,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 26 [2022-04-18 19:05:55,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-04-18 19:05:55,970 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-18 19:05:55,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-18 19:05:56,009 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-04-18 19:05:56,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2022-04-18 19:05:56,094 INFO L356 Elim1Store]: treesize reduction 110, result has 33.7 percent of original size [2022-04-18 19:05:56,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 74 [2022-04-18 19:05:56,180 INFO L356 Elim1Store]: treesize reduction 138, result has 16.9 percent of original size [2022-04-18 19:05:56,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 74 [2022-04-18 19:05:56,293 INFO L356 Elim1Store]: treesize reduction 184, result has 26.1 percent of original size [2022-04-18 19:05:56,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 78 treesize of output 114 [2022-04-18 19:05:56,444 INFO L356 Elim1Store]: treesize reduction 196, result has 15.9 percent of original size [2022-04-18 19:05:56,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 103 treesize of output 111 [2022-04-18 19:05:56,591 INFO L356 Elim1Store]: treesize reduction 298, result has 13.4 percent of original size [2022-04-18 19:05:56,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 112 treesize of output 123 [2022-04-18 19:05:56,952 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-04-18 19:05:56,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 76 [2022-04-18 19:05:56,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-18 19:05:56,989 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 19:05:56,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941137504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 19:05:56,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-18 19:05:56,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 24 [2022-04-18 19:05:56,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932177203] [2022-04-18 19:05:56,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 19:05:56,990 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-18 19:05:56,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:05:56,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-18 19:05:56,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2022-04-18 19:05:56,991 INFO L87 Difference]: Start difference. First operand 47519 states and 98292 transitions. Second operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:06:05,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:06:05,866 INFO L93 Difference]: Finished difference Result 54310 states and 112289 transitions. [2022-04-18 19:06:05,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-18 19:06:05,867 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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) Word has length 21 [2022-04-18 19:06:05,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:06:05,985 INFO L225 Difference]: With dead ends: 54310 [2022-04-18 19:06:05,985 INFO L226 Difference]: Without dead ends: 54310 [2022-04-18 19:06:05,986 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=189, Invalid=933, Unknown=0, NotChecked=0, Total=1122 [2022-04-18 19:06:05,986 INFO L913 BasicCegarLoop]: 448 mSDtfsCounter, 2032 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 8063 mSolverCounterSat, 578 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2032 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 8784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 578 IncrementalHoareTripleChecker+Valid, 8063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-04-18 19:06:05,986 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2032 Valid, 1173 Invalid, 8784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [578 Valid, 8063 Invalid, 0 Unknown, 143 Unchecked, 8.2s Time] [2022-04-18 19:06:06,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54310 states. [2022-04-18 19:06:06,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54310 to 47318. [2022-04-18 19:06:06,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47318 states, 45966 states have (on average 2.1294870121394074) internal successors, (97884), 47317 states have internal predecessors, (97884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:06:06,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47318 states to 47318 states and 97884 transitions. [2022-04-18 19:06:06,802 INFO L78 Accepts]: Start accepts. Automaton has 47318 states and 97884 transitions. Word has length 21 [2022-04-18 19:06:06,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:06:06,802 INFO L478 AbstractCegarLoop]: Abstraction has 47318 states and 97884 transitions. [2022-04-18 19:06:06,802 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:06:06,802 INFO L276 IsEmpty]: Start isEmpty. Operand 47318 states and 97884 transitions. [2022-04-18 19:06:06,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-18 19:06:06,803 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:06:06,803 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:06:06,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-18 19:06:07,003 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-18 19:06:07,004 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-04-18 19:06:07,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:06:07,004 INFO L85 PathProgramCache]: Analyzing trace with hash -986551927, now seen corresponding path program 3 times [2022-04-18 19:06:07,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:06:07,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157716870] [2022-04-18 19:06:07,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:06:07,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:06:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:06:07,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:06:07,198 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:06:07,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157716870] [2022-04-18 19:06:07,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157716870] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 19:06:07,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968490490] [2022-04-18 19:06:07,198 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 19:06:07,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:06:07,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 19:06:07,199 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 19:06:07,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-18 19:06:09,001 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 19:06:09,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 19:06:09,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-18 19:06:09,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 19:06:09,022 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-04-18 19:06:09,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 26 [2022-04-18 19:06:09,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-04-18 19:06:09,148 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-18 19:06:09,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-18 19:06:13,209 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-04-18 19:06:13,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2022-04-18 19:06:15,275 INFO L356 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-04-18 19:06:15,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 46 [2022-04-18 19:06:16,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 39 [2022-04-18 19:06:18,767 INFO L356 Elim1Store]: treesize reduction 176, result has 17.4 percent of original size [2022-04-18 19:06:18,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 50 treesize of output 58 [2022-04-18 19:06:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:06:18,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 19:06:18,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968490490] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 19:06:18,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-18 19:06:18,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 22 [2022-04-18 19:06:18,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207060365] [2022-04-18 19:06:18,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 19:06:18,803 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-18 19:06:18,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:06:18,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-18 19:06:18,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=474, Unknown=1, NotChecked=0, Total=552 [2022-04-18 19:06:18,804 INFO L87 Difference]: Start difference. First operand 47318 states and 97884 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:06:40,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:06:40,232 INFO L93 Difference]: Finished difference Result 101275 states and 209501 transitions. [2022-04-18 19:06:40,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-18 19:06:40,232 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 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) Word has length 21 [2022-04-18 19:06:40,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:06:40,479 INFO L225 Difference]: With dead ends: 101275 [2022-04-18 19:06:40,479 INFO L226 Difference]: Without dead ends: 101275 [2022-04-18 19:06:40,479 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 27.9s TimeCoverageRelationStatistics Valid=198, Invalid=854, Unknown=4, NotChecked=0, Total=1056 [2022-04-18 19:06:40,480 INFO L913 BasicCegarLoop]: 524 mSDtfsCounter, 2394 mSDsluCounter, 1615 mSDsCounter, 0 mSdLazyCounter, 1633 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2394 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 4004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2190 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-18 19:06:40,480 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2394 Valid, 1456 Invalid, 4004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1633 Invalid, 0 Unknown, 2190 Unchecked, 2.6s Time] [2022-04-18 19:06:40,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101275 states. [2022-04-18 19:06:41,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101275 to 47349. [2022-04-18 19:06:41,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47349 states, 45997 states have (on average 2.1294432245581234) internal successors, (97948), 47348 states have internal predecessors, (97948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:06:41,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47349 states to 47349 states and 97948 transitions. [2022-04-18 19:06:41,704 INFO L78 Accepts]: Start accepts. Automaton has 47349 states and 97948 transitions. Word has length 21 [2022-04-18 19:06:41,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:06:41,704 INFO L478 AbstractCegarLoop]: Abstraction has 47349 states and 97948 transitions. [2022-04-18 19:06:41,705 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:06:41,705 INFO L276 IsEmpty]: Start isEmpty. Operand 47349 states and 97948 transitions. [2022-04-18 19:06:41,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-18 19:06:41,705 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:06:41,705 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:06:41,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-18 19:06:41,906 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:06:41,906 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-04-18 19:06:41,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:06:41,907 INFO L85 PathProgramCache]: Analyzing trace with hash 184253143, now seen corresponding path program 4 times [2022-04-18 19:06:41,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:06:41,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712876877] [2022-04-18 19:06:41,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:06:41,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:06:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:06:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:06:42,197 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:06:42,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712876877] [2022-04-18 19:06:42,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712876877] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 19:06:42,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41045439] [2022-04-18 19:06:42,198 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-18 19:06:42,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:06:42,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 19:06:42,199 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 19:06:42,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-18 19:06:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:06:42,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 58 conjunts are in the unsatisfiable core [2022-04-18 19:06:42,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 19:06:42,669 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-04-18 19:06:42,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 26 [2022-04-18 19:06:42,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-04-18 19:06:42,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:42,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2022-04-18 19:06:42,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:42,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2022-04-18 19:06:42,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:42,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:42,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:42,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-04-18 19:06:42,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:42,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:42,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:42,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:42,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:42,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:42,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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 [2022-04-18 19:06:49,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 60 treesize of output 54 [2022-04-18 19:06:55,271 INFO L356 Elim1Store]: treesize reduction 306, result has 15.0 percent of original size [2022-04-18 19:06:55,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 67 treesize of output 78 [2022-04-18 19:06:57,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:06:57,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 19:06:57,353 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4247 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_4247) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4247 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_4247) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4247 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_4247) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:06:57,989 INFO L356 Elim1Store]: treesize reduction 396, result has 15.4 percent of original size [2022-04-18 19:06:57,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 case distinctions, treesize of input 574 treesize of output 165 [2022-04-18 19:06:57,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:57,995 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:57,995 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:57,995 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:58,009 INFO L356 Elim1Store]: treesize reduction 87, result has 4.4 percent of original size [2022-04-18 19:06:58,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 151 treesize of output 107 [2022-04-18 19:06:58,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 33 [2022-04-18 19:06:58,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 29 [2022-04-18 19:06:58,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 25 [2022-04-18 19:06:58,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:06:58,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41045439] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 19:06:58,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1342089844] [2022-04-18 19:06:58,120 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2022-04-18 19:06:58,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 19:06:58,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 33 [2022-04-18 19:06:58,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764865202] [2022-04-18 19:06:58,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 19:06:58,121 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-18 19:06:58,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:06:58,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-18 19:06:58,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=929, Unknown=18, NotChecked=64, Total=1190 [2022-04-18 19:06:58,122 INFO L87 Difference]: Start difference. First operand 47349 states and 97948 transitions. Second operand has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 34 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:07:02,160 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#b1~0#1.base| 3)) (= |c_worker_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_main_~#a~1#1.base|) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (forall ((v_ArrVal_4239 Int)) (or (not (= (let ((.cse1 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10))) (select (select (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|) .cse1 v_ArrVal_4239)))) (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse1)) 0)) (and (forall ((v_ArrVal_4247 (Array Int Int))) (= (let ((.cse4 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse2 (let ((.cse3 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_4239)))) (store .cse3 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select .cse3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) .cse4 0))))) (store .cse2 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_4247) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4)) 0)) (forall ((v_ArrVal_4247 (Array Int Int))) (= (let ((.cse7 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse5 (let ((.cse6 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_4239)))) (store .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse7 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse5 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse5 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_4247) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse7)) 0)) (forall ((v_ArrVal_4247 (Array Int Int))) (= (select (select (store (let ((.cse8 (let ((.cse9 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_4239)))) (store .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse8 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse8 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_4247) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))))) (= |c_~#pre~0.base| 3) (<= (div (+ (* (- 1) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset|) |c_ULTIMATE.start_main_~#a~1#1.offset|) (- 12)) 0)) is different from false [2022-04-18 19:07:02,249 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* (- 1) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#b1~0#1.base| 3)) (= |c_worker_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (= |c_worker_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_main_~#a~1#1.base|) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (forall ((v_ArrVal_4239 Int)) (or (not (= (let ((.cse1 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10))) (select (select (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|) .cse1 v_ArrVal_4239)))) (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse1)) 0)) (and (forall ((v_ArrVal_4247 (Array Int Int))) (= (let ((.cse4 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse2 (let ((.cse3 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_4239)))) (store .cse3 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select .cse3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) .cse4 0))))) (store .cse2 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_4247) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4)) 0)) (forall ((v_ArrVal_4247 (Array Int Int))) (= (let ((.cse7 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse5 (let ((.cse6 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_4239)))) (store .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse7 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse5 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse5 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_4247) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse7)) 0)) (forall ((v_ArrVal_4247 (Array Int Int))) (= (select (select (store (let ((.cse8 (let ((.cse9 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_4239)))) (store .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse8 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse8 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_4247) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))))) (<= (div (+ .cse10 |c_ULTIMATE.start_worker_fn_~a~0#1.offset| (- 12)) (- 12)) 0) (= |c_~#pre~0.base| 3) (not (= |c_worker_fnThread1of1ForFork0_#in~arg#1.base| 3)) (<= (div (+ .cse10 |c_ULTIMATE.start_main_~#a~1#1.offset|) (- 12)) 0))) is different from false [2022-04-18 19:07:06,539 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_4247 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_4247) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) (.cse1 (forall ((v_ArrVal_4247 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_4247) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) (.cse2 (forall ((v_ArrVal_4247 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_4247) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)))) (and .cse0 .cse1 (or (not (= (select (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10)) 0)) (and .cse0 .cse1 .cse2)) .cse2)) is different from false [2022-04-18 19:07:11,594 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_worker_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (forall ((v_ArrVal_4239 Int)) (or (not (= (let ((.cse1 (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10))) (select (select (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|) .cse1 v_ArrVal_4239)))) (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) .cse1)) 0)) (and (forall ((v_ArrVal_4247 (Array Int Int))) (= (let ((.cse4 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse2 (let ((.cse3 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_4239)))) (store .cse3 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select .cse3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) .cse4 0))))) (store .cse2 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_4247) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4)) 0)) (forall ((v_ArrVal_4247 (Array Int Int))) (= (let ((.cse7 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse5 (let ((.cse6 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_4239)))) (store .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse7 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse5 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse5 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_4247) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse7)) 0)) (forall ((v_ArrVal_4247 (Array Int Int))) (= (select (select (store (let ((.cse8 (let ((.cse9 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_4239)))) (store .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse8 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse8 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_4247) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))))) (<= (div (+ (* (- 1) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset|) |c_ULTIMATE.start_worker_fn_~a~0#1.offset| (- 12)) (- 12)) 0) (= |c_~#pre~0.base| 3) (not (= |c_worker_fnThread1of1ForFork0_#in~arg#1.base| 3))) is different from false [2022-04-18 19:07:12,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:07:12,264 INFO L93 Difference]: Finished difference Result 50350 states and 104068 transitions. [2022-04-18 19:07:12,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-18 19:07:12,264 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 34 states have internal predecessors, (58), 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) Word has length 21 [2022-04-18 19:07:12,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:07:12,349 INFO L225 Difference]: With dead ends: 50350 [2022-04-18 19:07:12,349 INFO L226 Difference]: Without dead ends: 50350 [2022-04-18 19:07:12,350 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=379, Invalid=1870, Unknown=27, NotChecked=480, Total=2756 [2022-04-18 19:07:12,350 INFO L913 BasicCegarLoop]: 475 mSDtfsCounter, 3921 mSDsluCounter, 9404 mSDsCounter, 0 mSdLazyCounter, 12124 mSolverCounterSat, 646 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3921 SdHoareTripleChecker+Valid, 5470 SdHoareTripleChecker+Invalid, 28729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 646 IncrementalHoareTripleChecker+Valid, 12124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15959 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-04-18 19:07:12,351 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3921 Valid, 5470 Invalid, 28729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [646 Valid, 12124 Invalid, 0 Unknown, 15959 Unchecked, 9.0s Time] [2022-04-18 19:07:12,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50350 states. [2022-04-18 19:07:13,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50350 to 47362. [2022-04-18 19:07:13,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47362 states, 46010 states have (on average 2.1293849163225387) internal successors, (97973), 47361 states have internal predecessors, (97973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:07:13,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47362 states to 47362 states and 97973 transitions. [2022-04-18 19:07:13,146 INFO L78 Accepts]: Start accepts. Automaton has 47362 states and 97973 transitions. Word has length 21 [2022-04-18 19:07:13,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:07:13,146 INFO L478 AbstractCegarLoop]: Abstraction has 47362 states and 97973 transitions. [2022-04-18 19:07:13,146 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 34 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:07:13,146 INFO L276 IsEmpty]: Start isEmpty. Operand 47362 states and 97973 transitions. [2022-04-18 19:07:13,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-18 19:07:13,147 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:07:13,147 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:07:13,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-18 19:07:13,347 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-04-18 19:07:13,348 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-04-18 19:07:13,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:07:13,348 INFO L85 PathProgramCache]: Analyzing trace with hash 183807673, now seen corresponding path program 5 times [2022-04-18 19:07:13,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:07:13,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207822378] [2022-04-18 19:07:13,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:07:13,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:07:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:07:13,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:07:13,684 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:07:13,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207822378] [2022-04-18 19:07:13,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207822378] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 19:07:13,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973620309] [2022-04-18 19:07:13,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 19:07:13,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:07:13,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 19:07:13,686 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 19:07:13,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-18 19:07:14,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-18 19:07:14,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 19:07:14,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-18 19:07:14,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 19:07:14,758 INFO L356 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2022-04-18 19:07:14,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 37 [2022-04-18 19:07:14,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-04-18 19:07:14,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:07:14,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2022-04-18 19:07:14,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:07:14,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2022-04-18 19:07:14,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:07:14,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:07:14,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:07:14,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-04-18 19:07:15,051 INFO L356 Elim1Store]: treesize reduction 138, result has 16.9 percent of original size [2022-04-18 19:07:15,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 50 [2022-04-18 19:07:15,121 INFO L356 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-04-18 19:07:15,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 46 [2022-04-18 19:07:15,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 39 [2022-04-18 19:07:15,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:07:15,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 19:07:15,201 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4573 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_4573) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4573 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_4573) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4573 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_4573) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4573 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_4573) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:07:15,315 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4570 Int)) (= (select (select (store (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_4570)))) (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))) |c_~#pre~0.base| v_ArrVal_4573) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4570 Int)) (= (let ((.cse2 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse1 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_4570)))) (store .cse1 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse1 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2 0))) |c_~#pre~0.base| v_ArrVal_4573) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2)) 0)) (forall ((v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4570 Int)) (= (select (select (store (let ((.cse3 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_4570)))) (store .cse3 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))) |c_~#pre~0.base| v_ArrVal_4573) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4570 Int)) (= (select (select (store (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_4570)))) (store .cse4 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse4 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))) |c_~#pre~0.base| v_ArrVal_4573) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:07:15,463 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4570 Int)) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse1 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_4570))))) (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))) |c_~#pre~0.base| v_ArrVal_4573) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4570 Int)) (= (let ((.cse4 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse2 (let ((.cse3 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse3 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse3 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_4570))))) (store .cse2 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse2 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))) |c_~#pre~0.base| v_ArrVal_4573) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4)) 0)) (forall ((v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4570 Int)) (= (let ((.cse7 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse5 (let ((.cse6 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) .cse7 0)))) (store .cse6 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse6 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_4570))))) (store .cse5 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse5 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))) |c_~#pre~0.base| v_ArrVal_4573) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse7)) 0))) is different from false [2022-04-18 19:07:15,491 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4563 Int) (v_ArrVal_4570 Int)) (= (let ((.cse3 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse0 (let ((.cse1 (let ((.cse2 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_4563)))) (store .cse2 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select .cse2 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) .cse3 0))))) (store .cse1 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_4570))))) (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))) |c_~#pre~0.base| v_ArrVal_4573) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3)) 0)) (forall ((v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4563 Int) (v_ArrVal_4570 Int)) (= (select (select (store (let ((.cse4 (let ((.cse5 (let ((.cse6 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_4563)))) (store .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse5 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse5 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_4570))))) (store .cse4 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse4 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))) |c_~#pre~0.base| v_ArrVal_4573) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4563 Int) (v_ArrVal_4570 Int)) (= (let ((.cse10 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse7 (let ((.cse8 (let ((.cse9 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_4563)))) (store .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse10 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse8 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse8 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_4570))))) (store .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))) |c_~#pre~0.base| v_ArrVal_4573) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse10)) 0))) is different from false [2022-04-18 19:07:15,634 INFO L356 Elim1Store]: treesize reduction 570, result has 20.8 percent of original size [2022-04-18 19:07:15,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 case distinctions, treesize of input 342 treesize of output 162 [2022-04-18 19:07:15,715 INFO L356 Elim1Store]: treesize reduction 104, result has 49.3 percent of original size [2022-04-18 19:07:15,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 175 treesize of output 233 [2022-04-18 19:07:15,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-04-18 19:07:15,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:15,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:15,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:15,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:15,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:15,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:15,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:15,882 INFO L356 Elim1Store]: treesize reduction 339, result has 13.1 percent of original size [2022-04-18 19:07:15,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 342 treesize of output 63 [2022-04-18 19:07:15,884 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:15,886 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:15,886 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:15,886 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:15,887 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:15,887 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:15,887 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:15,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2022-04-18 19:07:15,895 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:15,896 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:15,896 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:15,896 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:15,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:15,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:15,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:15,916 INFO L356 Elim1Store]: treesize reduction 389, result has 0.3 percent of original size [2022-04-18 19:07:15,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 342 treesize of output 1 [2022-04-18 19:07:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:07:16,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973620309] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 19:07:16,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1793054264] [2022-04-18 19:07:16,095 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2022-04-18 19:07:16,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 19:07:16,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 33 [2022-04-18 19:07:16,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545112033] [2022-04-18 19:07:16,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 19:07:16,096 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-18 19:07:16,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:07:16,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-18 19:07:16,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=786, Unknown=19, NotChecked=244, Total=1190 [2022-04-18 19:07:16,096 INFO L87 Difference]: Start difference. First operand 47362 states and 97973 transitions. Second operand has 35 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 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) [2022-04-18 19:07:30,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:07:30,580 INFO L93 Difference]: Finished difference Result 161785 states and 334522 transitions. [2022-04-18 19:07:30,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-18 19:07:30,581 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 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) Word has length 21 [2022-04-18 19:07:30,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:07:30,928 INFO L225 Difference]: With dead ends: 161785 [2022-04-18 19:07:30,928 INFO L226 Difference]: Without dead ends: 161785 [2022-04-18 19:07:30,929 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 54 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=486, Invalid=2160, Unknown=22, NotChecked=412, Total=3080 [2022-04-18 19:07:30,929 INFO L913 BasicCegarLoop]: 728 mSDtfsCounter, 9507 mSDsluCounter, 8581 mSDsCounter, 0 mSdLazyCounter, 16851 mSolverCounterSat, 930 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9507 SdHoareTripleChecker+Valid, 5234 SdHoareTripleChecker+Invalid, 29364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 930 IncrementalHoareTripleChecker+Valid, 16851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11583 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2022-04-18 19:07:30,929 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9507 Valid, 5234 Invalid, 29364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [930 Valid, 16851 Invalid, 0 Unknown, 11583 Unchecked, 12.7s Time] [2022-04-18 19:07:31,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161785 states. [2022-04-18 19:07:32,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161785 to 47373. [2022-04-18 19:07:32,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47373 states, 46021 states have (on average 2.1293539905695225) internal successors, (97995), 47372 states have internal predecessors, (97995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:07:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47373 states to 47373 states and 97995 transitions. [2022-04-18 19:07:32,435 INFO L78 Accepts]: Start accepts. Automaton has 47373 states and 97995 transitions. Word has length 21 [2022-04-18 19:07:32,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:07:32,435 INFO L478 AbstractCegarLoop]: Abstraction has 47373 states and 97995 transitions. [2022-04-18 19:07:32,435 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 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) [2022-04-18 19:07:32,435 INFO L276 IsEmpty]: Start isEmpty. Operand 47373 states and 97995 transitions. [2022-04-18 19:07:32,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-18 19:07:32,436 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:07:32,436 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:07:32,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-18 19:07:32,637 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-18 19:07:32,637 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-04-18 19:07:32,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:07:32,638 INFO L85 PathProgramCache]: Analyzing trace with hash 167374573, now seen corresponding path program 6 times [2022-04-18 19:07:32,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:07:32,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435510440] [2022-04-18 19:07:32,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:07:32,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:07:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:07:32,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:07:32,944 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:07:32,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435510440] [2022-04-18 19:07:32,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435510440] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 19:07:32,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483124955] [2022-04-18 19:07:32,944 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 19:07:32,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:07:32,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 19:07:32,945 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 19:07:32,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-18 19:07:40,711 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 19:07:40,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 19:07:40,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 62 conjunts are in the unsatisfiable core [2022-04-18 19:07:40,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 19:07:40,752 INFO L356 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2022-04-18 19:07:40,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 37 [2022-04-18 19:07:40,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-04-18 19:07:40,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:07:40,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2022-04-18 19:07:40,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:07:40,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2022-04-18 19:07:40,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:07:40,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:07:40,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:07:40,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-04-18 19:07:41,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:07:41,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:07:41,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:07:41,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:07:41,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:07:41,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:07:41,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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 [2022-04-18 19:07:45,174 INFO L356 Elim1Store]: treesize reduction 200, result has 17.0 percent of original size [2022-04-18 19:07:45,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 54 treesize of output 62 [2022-04-18 19:07:47,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 50 [2022-04-18 19:07:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:07:49,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 19:07:49,360 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4897 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_4897) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4897 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_4897) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4897 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_4897) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4897 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_4897) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:07:49,380 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4897 (Array Int Int))) (= (let ((.cse0 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse0 0)) |c_~#pre~0.base| v_ArrVal_4897) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse0)) 0)) (forall ((v_ArrVal_4897 (Array Int Int))) (= (select (select (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)) |c_~#pre~0.base| v_ArrVal_4897) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4897 (Array Int Int))) (= 0 (select (select (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)) |c_~#pre~0.base| v_ArrVal_4897) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (forall ((v_ArrVal_4897 (Array Int Int))) (= (select (select (store (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)) |c_~#pre~0.base| v_ArrVal_4897) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:07:49,453 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4897 (Array Int Int))) (= (select (select (store (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0)))) (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))) |c_~#pre~0.base| v_ArrVal_4897) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4897 (Array Int Int))) (= (select (select (store (let ((.cse1 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0)))) (store .cse1 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse1 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))) |c_~#pre~0.base| v_ArrVal_4897) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4897 (Array Int Int))) (= (select (select (store (let ((.cse2 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0)))) (store .cse2 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse2 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))) |c_~#pre~0.base| v_ArrVal_4897) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4897 (Array Int Int))) (= 0 (let ((.cse4 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse3 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0)))) (store .cse3 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4 0))) |c_~#pre~0.base| v_ArrVal_4897) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4))))) is different from false [2022-04-18 19:07:49,473 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4897 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse1 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))))) (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))) |c_~#pre~0.base| v_ArrVal_4897) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4897 (Array Int Int))) (= (let ((.cse4 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse2 (let ((.cse3 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4 0)))) (store .cse3 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse3 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))))) (store .cse2 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse2 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))) |c_~#pre~0.base| v_ArrVal_4897) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4)) 0)) (forall ((v_ArrVal_4897 (Array Int Int))) (= 0 (let ((.cse6 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse5 (let ((.cse7 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse7 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse7 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))))) (store .cse5 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse5 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse6 0))) |c_~#pre~0.base| v_ArrVal_4897) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse6)))) (forall ((v_ArrVal_4897 (Array Int Int))) (= (select (select (store (let ((.cse8 (let ((.cse9 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse9 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse9 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))))) (store .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))) |c_~#pre~0.base| v_ArrVal_4897) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:07:49,495 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4897 (Array Int Int))) (= (let ((.cse2 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) .cse2 0)))) (store .cse1 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))))) (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))) |c_~#pre~0.base| v_ArrVal_4897) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2)) 0)) (forall ((v_ArrVal_4897 (Array Int Int))) (= (let ((.cse4 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse3 (let ((.cse5 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse5 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse5 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))))) (store .cse3 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4 0))) |c_~#pre~0.base| v_ArrVal_4897) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4)) 0)) (forall ((v_ArrVal_4897 (Array Int Int))) (= (select (select (store (let ((.cse6 (let ((.cse7 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse7 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse7 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))))) (store .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))) |c_~#pre~0.base| v_ArrVal_4897) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4897 (Array Int Int))) (= (let ((.cse10 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse8 (let ((.cse9 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse10 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse9 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse9 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))))) (store .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))) |c_~#pre~0.base| v_ArrVal_4897) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse10)) 0))) is different from false [2022-04-18 19:07:49,526 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4888 Int) (v_ArrVal_4897 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (let ((.cse2 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_4888)))) (store .cse2 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select .cse2 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse1 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))))) (store .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse0 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))) |c_~#pre~0.base| v_ArrVal_4897) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_4888 Int) (v_ArrVal_4897 (Array Int Int))) (= (let ((.cse6 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse3 (let ((.cse4 (let ((.cse5 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_4888)))) (store .cse5 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select .cse5 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) .cse6 0))))) (store .cse4 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse4 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))))) (store .cse3 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))) |c_~#pre~0.base| v_ArrVal_4897) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse6)) 0)) (forall ((v_ArrVal_4888 Int) (v_ArrVal_4897 (Array Int Int))) (= (let ((.cse10 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse7 (let ((.cse8 (let ((.cse9 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_4888)))) (store .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse10 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse8 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse8 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))))) (store .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))) |c_~#pre~0.base| v_ArrVal_4897) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse10)) 0)) (forall ((v_ArrVal_4888 Int) (v_ArrVal_4897 (Array Int Int))) (= (let ((.cse12 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse11 (let ((.cse13 (let ((.cse14 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_4888)))) (store .cse14 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select .cse14 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse13 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse13 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))))) (store .cse11 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse11 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse12 0))) |c_~#pre~0.base| v_ArrVal_4897) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse12)) 0))) is different from false [2022-04-18 19:07:49,638 INFO L356 Elim1Store]: treesize reduction 615, result has 14.6 percent of original size [2022-04-18 19:07:49,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 case distinctions, treesize of input 342 treesize of output 117 [2022-04-18 19:07:49,679 INFO L356 Elim1Store]: treesize reduction 154, result has 24.9 percent of original size [2022-04-18 19:07:49,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 130 treesize of output 138 [2022-04-18 19:07:49,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-04-18 19:07:49,768 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:49,768 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:49,769 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:49,769 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:49,769 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:49,770 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:49,770 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:49,801 INFO L356 Elim1Store]: treesize reduction 389, result has 0.3 percent of original size [2022-04-18 19:07:49,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 342 treesize of output 1 [2022-04-18 19:07:49,805 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:49,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:49,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:49,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:49,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:49,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:49,808 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:50,055 INFO L356 Elim1Store]: treesize reduction 389, result has 0.3 percent of original size [2022-04-18 19:07:50,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 342 treesize of output 1 [2022-04-18 19:07:50,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:50,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:50,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:50,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:50,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:50,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:50,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:07:50,090 INFO L356 Elim1Store]: treesize reduction 389, result has 0.3 percent of original size [2022-04-18 19:07:50,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 342 treesize of output 1 [2022-04-18 19:07:50,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:07:50,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483124955] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 19:07:50,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [670909253] [2022-04-18 19:07:50,233 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2022-04-18 19:07:50,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 19:07:50,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 34 [2022-04-18 19:07:50,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320687619] [2022-04-18 19:07:50,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 19:07:50,234 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-18 19:07:50,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:07:50,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-18 19:07:50,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=749, Unknown=7, NotChecked=366, Total=1260 [2022-04-18 19:07:50,234 INFO L87 Difference]: Start difference. First operand 47373 states and 97995 transitions. Second operand has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 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) [2022-04-18 19:08:36,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:08:36,299 INFO L93 Difference]: Finished difference Result 147830 states and 305862 transitions. [2022-04-18 19:08:36,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-18 19:08:36,299 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 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) Word has length 21 [2022-04-18 19:08:36,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:08:36,610 INFO L225 Difference]: With dead ends: 147830 [2022-04-18 19:08:36,611 INFO L226 Difference]: Without dead ends: 147830 [2022-04-18 19:08:36,611 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 54 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 43.4s TimeCoverageRelationStatistics Valid=482, Invalid=1977, Unknown=15, NotChecked=606, Total=3080 [2022-04-18 19:08:36,612 INFO L913 BasicCegarLoop]: 726 mSDtfsCounter, 9192 mSDsluCounter, 7385 mSDsCounter, 0 mSdLazyCounter, 11773 mSolverCounterSat, 1284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9192 SdHoareTripleChecker+Valid, 4980 SdHoareTripleChecker+Invalid, 32354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1284 IncrementalHoareTripleChecker+Valid, 11773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19297 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-04-18 19:08:36,612 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9192 Valid, 4980 Invalid, 32354 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1284 Valid, 11773 Invalid, 0 Unknown, 19297 Unchecked, 10.2s Time] [2022-04-18 19:08:36,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147830 states. [2022-04-18 19:08:37,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147830 to 47362. [2022-04-18 19:08:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47362 states, 46010 states have (on average 2.1293849163225387) internal successors, (97973), 47361 states have internal predecessors, (97973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:08:38,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47362 states to 47362 states and 97973 transitions. [2022-04-18 19:08:38,048 INFO L78 Accepts]: Start accepts. Automaton has 47362 states and 97973 transitions. Word has length 21 [2022-04-18 19:08:38,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:08:38,048 INFO L478 AbstractCegarLoop]: Abstraction has 47362 states and 97973 transitions. [2022-04-18 19:08:38,048 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 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) [2022-04-18 19:08:38,048 INFO L276 IsEmpty]: Start isEmpty. Operand 47362 states and 97973 transitions. [2022-04-18 19:08:38,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-18 19:08:38,049 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:08:38,049 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:08:38,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-18 19:08:38,252 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-18 19:08:38,252 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-04-18 19:08:38,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:08:38,253 INFO L85 PathProgramCache]: Analyzing trace with hash -929155061, now seen corresponding path program 7 times [2022-04-18 19:08:38,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:08:38,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731339039] [2022-04-18 19:08:38,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:08:38,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:08:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:08:38,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:08:38,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:08:38,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731339039] [2022-04-18 19:08:38,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731339039] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 19:08:38,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771982610] [2022-04-18 19:08:38,556 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-18 19:08:38,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:08:38,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 19:08:38,557 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 19:08:38,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-18 19:08:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:08:39,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-18 19:08:39,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 19:08:39,038 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 19:08:39,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 19 [2022-04-18 19:08:39,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-04-18 19:08:39,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:08:39,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2022-04-18 19:08:39,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:08:39,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2022-04-18 19:08:39,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:08:39,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:08:39,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:08:39,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-04-18 19:08:39,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:08:39,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:08:39,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:08:39,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-04-18 19:08:39,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:08:39,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:08:39,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:08:39,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:08:39,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:08:39,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:08:39,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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 [2022-04-18 19:08:45,527 INFO L356 Elim1Store]: treesize reduction 306, result has 15.0 percent of original size [2022-04-18 19:08:45,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 67 treesize of output 78 [2022-04-18 19:08:47,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 61 [2022-04-18 19:08:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:08:49,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 19:08:49,700 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5222 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_5222) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_5222 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_5222) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_5222 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_5222) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_5222 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_5222) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))))) is different from false [2022-04-18 19:08:50,987 INFO L356 Elim1Store]: treesize reduction 942, result has 12.7 percent of original size [2022-04-18 19:08:50,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 case distinctions, treesize of input 2904 treesize of output 500 [2022-04-18 19:08:50,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:08:50,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:08:50,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:08:50,995 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:08:50,995 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:08:50,995 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:08:50,996 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:08:50,996 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:08:50,996 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:08:51,047 INFO L356 Elim1Store]: treesize reduction 126, result has 30.4 percent of original size [2022-04-18 19:08:51,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 190 treesize of output 190 [2022-04-18 19:08:51,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 37 [2022-04-18 19:08:51,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 33 [2022-04-18 19:08:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:08:51,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771982610] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 19:08:51,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [77525865] [2022-04-18 19:08:51,526 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2022-04-18 19:08:51,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 19:08:51,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 37 [2022-04-18 19:08:51,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264859042] [2022-04-18 19:08:51,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 19:08:51,532 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-18 19:08:51,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:08:51,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-18 19:08:51,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1180, Unknown=29, NotChecked=72, Total=1482 [2022-04-18 19:08:51,532 INFO L87 Difference]: Start difference. First operand 47362 states and 97973 transitions. Second operand has 39 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:10:28,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:10:28,183 INFO L93 Difference]: Finished difference Result 104317 states and 215752 transitions. [2022-04-18 19:10:28,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-18 19:10:28,184 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-04-18 19:10:28,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:10:28,465 INFO L225 Difference]: With dead ends: 104317 [2022-04-18 19:10:28,465 INFO L226 Difference]: Without dead ends: 104317 [2022-04-18 19:10:28,466 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 25 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 97.0s TimeCoverageRelationStatistics Valid=878, Invalid=2973, Unknown=59, NotChecked=122, Total=4032 [2022-04-18 19:10:28,466 INFO L913 BasicCegarLoop]: 579 mSDtfsCounter, 8065 mSDsluCounter, 7676 mSDsCounter, 0 mSdLazyCounter, 11151 mSolverCounterSat, 795 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8065 SdHoareTripleChecker+Valid, 4453 SdHoareTripleChecker+Invalid, 26218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 795 IncrementalHoareTripleChecker+Valid, 11151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14272 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-04-18 19:10:28,466 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8065 Valid, 4453 Invalid, 26218 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [795 Valid, 11151 Invalid, 0 Unknown, 14272 Unchecked, 10.2s Time] [2022-04-18 19:10:28,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104317 states. [2022-04-18 19:10:29,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104317 to 47348. [2022-04-18 19:10:29,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47348 states, 45996 states have (on average 2.129402556744065) internal successors, (97944), 47347 states have internal predecessors, (97944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:10:29,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47348 states to 47348 states and 97944 transitions. [2022-04-18 19:10:29,725 INFO L78 Accepts]: Start accepts. Automaton has 47348 states and 97944 transitions. Word has length 21 [2022-04-18 19:10:29,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:10:29,725 INFO L478 AbstractCegarLoop]: Abstraction has 47348 states and 97944 transitions. [2022-04-18 19:10:29,725 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:10:29,725 INFO L276 IsEmpty]: Start isEmpty. Operand 47348 states and 97944 transitions. [2022-04-18 19:10:29,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-18 19:10:29,726 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:10:29,726 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:10:29,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-18 19:10:29,939 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-18 19:10:29,939 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-04-18 19:10:29,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:10:29,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1942987319, now seen corresponding path program 8 times [2022-04-18 19:10:29,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:10:29,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786755469] [2022-04-18 19:10:29,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:10:29,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:10:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:10:30,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:10:30,313 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:10:30,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786755469] [2022-04-18 19:10:30,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786755469] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 19:10:30,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342485463] [2022-04-18 19:10:30,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 19:10:30,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:10:30,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 19:10:30,314 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 19:10:30,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-18 19:10:31,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-18 19:10:31,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 19:10:31,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-18 19:10:31,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 19:10:31,421 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-04-18 19:10:31,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 60 [2022-04-18 19:10:31,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-04-18 19:10:31,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:10:31,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2022-04-18 19:10:31,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:10:31,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2022-04-18 19:10:31,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:10:31,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:10:31,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:10:31,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-04-18 19:10:31,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:10:31,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:10:31,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:10:31,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-04-18 19:10:31,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:10:31,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:10:31,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:10:31,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:10:31,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:10:31,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:10:31,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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 [2022-04-18 19:10:32,016 INFO L356 Elim1Store]: treesize reduction 208, result has 15.1 percent of original size [2022-04-18 19:10:32,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 54 treesize of output 62 [2022-04-18 19:10:36,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 50 [2022-04-18 19:10:40,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:10:40,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 19:10:40,223 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5545 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_5545) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_5545 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_5545) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_5545 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_5545) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_5545 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_5545) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))))) is different from false [2022-04-18 19:10:40,254 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5545 (Array Int Int))) (= (select (select (store (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0)) |c_~#pre~0.base| v_ArrVal_5545) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_5545 (Array Int Int))) (= (select (select (store (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0)) |c_~#pre~0.base| v_ArrVal_5545) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_5545 (Array Int Int))) (= (select (select (store (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0)) |c_~#pre~0.base| v_ArrVal_5545) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_5545 (Array Int Int))) (= (select (select (store (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0)) |c_~#pre~0.base| v_ArrVal_5545) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:10:40,271 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5545 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse0 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse0 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_5545) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_5545 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse1 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_5545) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_5545 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse2 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_5545) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_5545 (Array Int Int))) (= (let ((.cse4 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse3 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4 0)))) (store .cse3 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse3 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_5545) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4)) 0))) is different from false [2022-04-18 19:10:40,421 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5537 Int) (v_ArrVal_5545 (Array Int Int))) (= (let ((.cse2 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse0 (let ((.cse1 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_5537)))) (store .cse1 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select .cse1 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2 0) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse0 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse0 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_5545) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2)) 0)) (forall ((v_ArrVal_5537 Int) (v_ArrVal_5545 (Array Int Int))) (= (let ((.cse5 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse3 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_5537)))) (store .cse4 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select .cse4 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) .cse5 0))))) (store .cse3 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse3 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_5545) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5)) 0)) (forall ((v_ArrVal_5537 Int) (v_ArrVal_5545 (Array Int Int))) (= (select (select (store (let ((.cse6 (let ((.cse7 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_5537)))) (store .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select .cse7 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse6 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse6 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_5545) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_5537 Int) (v_ArrVal_5545 (Array Int Int))) (= (select (select (store (let ((.cse8 (let ((.cse9 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_5537)))) (store .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse8 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse8 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_5545) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:10:41,056 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5537 Int) (v_ArrVal_5545 (Array Int Int)) (v_ArrVal_5533 Int)) (= 0 (select (select (store (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_5533)))) (store .cse3 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse2 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_5537))))) (store .cse1 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select .cse1 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse0 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse0 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_5545) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (forall ((v_ArrVal_5537 Int) (v_ArrVal_5545 (Array Int Int)) (v_ArrVal_5533 Int)) (= (let ((.cse6 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse4 (let ((.cse5 (let ((.cse7 (let ((.cse8 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_5533)))) (store .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse7 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse7 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_5537))))) (store .cse5 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select .cse5 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) .cse6 0))))) (store .cse4 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse4 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_5545) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse6)) 0)) (forall ((v_ArrVal_5537 Int) (v_ArrVal_5545 (Array Int Int)) (v_ArrVal_5533 Int)) (= (let ((.cse11 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse9 (let ((.cse10 (let ((.cse12 (let ((.cse13 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_5533)))) (store .cse13 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse13 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse12 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse12 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_5537))))) (store .cse10 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select .cse10 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse11 0) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse9 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse9 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_5545) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse11)) 0)) (forall ((v_ArrVal_5537 Int) (v_ArrVal_5545 (Array Int Int)) (v_ArrVal_5533 Int)) (= (let ((.cse18 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse14 (let ((.cse15 (let ((.cse16 (let ((.cse17 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_5533)))) (store .cse17 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse17 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse18 0))))) (store .cse16 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse16 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_5537))))) (store .cse15 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select .cse15 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse14 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select .cse14 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_5545) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse18)) 0))) is different from false [2022-04-18 19:10:41,277 INFO L356 Elim1Store]: treesize reduction 925, result has 14.7 percent of original size [2022-04-18 19:10:41,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 case distinctions, treesize of input 652 treesize of output 171 [2022-04-18 19:10:41,353 INFO L356 Elim1Store]: treesize reduction 188, result has 34.9 percent of original size [2022-04-18 19:10:41,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 184 treesize of output 236 [2022-04-18 19:10:41,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 19:10:41,488 INFO L356 Elim1Store]: treesize reduction 1083, result has 0.1 percent of original size [2022-04-18 19:10:41,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 652 treesize of output 1 [2022-04-18 19:10:41,623 INFO L356 Elim1Store]: treesize reduction 1033, result has 4.7 percent of original size [2022-04-18 19:10:41,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 652 treesize of output 63 [2022-04-18 19:10:41,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:10:41,627 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:10:41,627 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:10:41,627 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:10:41,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2022-04-18 19:10:41,634 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:10:41,634 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:10:41,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:10:41,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:10:41,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:10:41,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:10:41,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:10:41,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:10:41,637 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:10:41,729 INFO L356 Elim1Store]: treesize reduction 528, result has 10.4 percent of original size [2022-04-18 19:10:41,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 652 treesize of output 73 [2022-04-18 19:10:41,731 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:10:41,733 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:10:41,733 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:10:41,733 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:10:41,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:10:41,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:10:41,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:10:41,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2022-04-18 19:10:41,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:10:41,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342485463] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 19:10:41,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1620471332] [2022-04-18 19:10:41,989 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2022-04-18 19:10:41,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 19:10:41,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 34 [2022-04-18 19:10:41,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076759150] [2022-04-18 19:10:41,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 19:10:41,990 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-18 19:10:41,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:10:41,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-18 19:10:41,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=771, Unknown=19, NotChecked=310, Total=1260 [2022-04-18 19:10:41,991 INFO L87 Difference]: Start difference. First operand 47348 states and 97944 transitions. Second operand has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 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) [2022-04-18 19:11:21,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:11:21,774 INFO L93 Difference]: Finished difference Result 245742 states and 509016 transitions. [2022-04-18 19:11:21,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-18 19:11:21,775 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 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) Word has length 21 [2022-04-18 19:11:21,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:11:22,716 INFO L225 Difference]: With dead ends: 245742 [2022-04-18 19:11:22,716 INFO L226 Difference]: Without dead ends: 245742 [2022-04-18 19:11:22,717 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 23 SyntacticMatches, 13 SemanticMatches, 53 ConstructedPredicates, 5 IntricatePredicates, 2 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 36.8s TimeCoverageRelationStatistics Valid=525, Invalid=1919, Unknown=26, NotChecked=500, Total=2970 [2022-04-18 19:11:22,717 INFO L913 BasicCegarLoop]: 715 mSDtfsCounter, 8600 mSDsluCounter, 12891 mSDsCounter, 0 mSdLazyCounter, 13016 mSolverCounterSat, 1468 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8600 SdHoareTripleChecker+Valid, 8332 SdHoareTripleChecker+Invalid, 34237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1468 IncrementalHoareTripleChecker+Valid, 13016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19753 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2022-04-18 19:11:22,718 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8600 Valid, 8332 Invalid, 34237 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1468 Valid, 13016 Invalid, 0 Unknown, 19753 Unchecked, 11.1s Time] [2022-04-18 19:11:23,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245742 states. [2022-04-18 19:11:24,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245742 to 47363. [2022-04-18 19:11:24,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47363 states, 46011 states have (on average 2.1293821042794114) internal successors, (97975), 47362 states have internal predecessors, (97975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:11:24,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47363 states to 47363 states and 97975 transitions. [2022-04-18 19:11:24,928 INFO L78 Accepts]: Start accepts. Automaton has 47363 states and 97975 transitions. Word has length 21 [2022-04-18 19:11:24,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:11:24,928 INFO L478 AbstractCegarLoop]: Abstraction has 47363 states and 97975 transitions. [2022-04-18 19:11:24,928 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 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) [2022-04-18 19:11:24,928 INFO L276 IsEmpty]: Start isEmpty. Operand 47363 states and 97975 transitions. [2022-04-18 19:11:24,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-18 19:11:24,929 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:11:24,929 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:11:24,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-18 19:11:25,130 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-04-18 19:11:25,130 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-04-18 19:11:25,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:11:25,130 INFO L85 PathProgramCache]: Analyzing trace with hash 470725739, now seen corresponding path program 9 times [2022-04-18 19:11:25,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:11:25,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269686205] [2022-04-18 19:11:25,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:11:25,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:11:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:11:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:11:25,525 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:11:25,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269686205] [2022-04-18 19:11:25,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269686205] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 19:11:25,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276042001] [2022-04-18 19:11:25,526 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 19:11:25,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:11:25,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 19:11:25,527 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 19:11:25,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-18 19:11:27,778 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 19:11:27,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 19:11:27,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 112 conjunts are in the unsatisfiable core [2022-04-18 19:11:27,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 19:11:27,837 INFO L356 Elim1Store]: treesize reduction 129, result has 17.8 percent of original size [2022-04-18 19:11:27,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 45 treesize of output 57 [2022-04-18 19:11:27,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2022-04-18 19:11:28,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 43 [2022-04-18 19:11:28,055 INFO L356 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-04-18 19:11:28,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2022-04-18 19:11:28,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2022-04-18 19:11:28,238 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:11:28,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2022-04-18 19:11:28,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-04-18 19:11:28,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2022-04-18 19:11:28,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2022-04-18 19:11:28,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-04-18 19:11:28,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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 [2022-04-18 19:11:28,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 19:11:28,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 70 [2022-04-18 19:11:28,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:11:28,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 70 [2022-04-18 19:11:28,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 19:11:28,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 19:11:39,220 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_worker_fn_~tid~0#1_2612| Int)) (or (not (<= |v_ULTIMATE.start_worker_fn_~tid~0#1_2612| |c_ULTIMATE.start_worker_fn_#t~mem17#1|)) (and (forall ((v_ArrVal_5886 Int) (v_ArrVal_5883 Int)) (= (select (select (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_5883)))) (store .cse0 |c_~#pre~0.base| (store (select .cse0 |c_~#pre~0.base|) (+ |c_~#pre~0.offset| |v_ULTIMATE.start_worker_fn_~tid~0#1_2612|) v_ArrVal_5886))) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_5886 Int) (v_ArrVal_5883 Int)) (= (select (select (let ((.cse1 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_5883)))) (store .cse1 |c_~#pre~0.base| (store (select .cse1 |c_~#pre~0.base|) (+ |c_~#pre~0.offset| |v_ULTIMATE.start_worker_fn_~tid~0#1_2612|) v_ArrVal_5886))) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_5886 Int) (v_ArrVal_5883 Int)) (= (select (select (let ((.cse2 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_5883)))) (store .cse2 |c_~#pre~0.base| (store (select .cse2 |c_~#pre~0.base|) (+ |c_~#pre~0.offset| |v_ULTIMATE.start_worker_fn_~tid~0#1_2612|) v_ArrVal_5886))) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_5886 Int) (v_ArrVal_5883 Int)) (= (select (select (let ((.cse3 (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|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_5883)))) (store .cse3 |c_~#pre~0.base| (store (select .cse3 |c_~#pre~0.base|) (+ |c_~#pre~0.offset| |v_ULTIMATE.start_worker_fn_~tid~0#1_2612|) v_ArrVal_5886))) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))))) is different from false [2022-04-18 19:11:43,490 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_worker_fn_~tid~0#1_2612| Int)) (or (not (<= |v_ULTIMATE.start_worker_fn_~tid~0#1_2612| |c_ULTIMATE.start_worker_fn_#t~mem17#1|)) (and (forall ((v_ArrVal_5886 Int) (v_ArrVal_5883 Int)) (= 0 (select (select (let ((.cse0 (let ((.cse1 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse1 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse1 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_5883))))) (store .cse0 |c_~#pre~0.base| (store (select .cse0 |c_~#pre~0.base|) (+ |c_~#pre~0.offset| |v_ULTIMATE.start_worker_fn_~tid~0#1_2612|) v_ArrVal_5886))) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (forall ((v_ArrVal_5886 Int) (v_ArrVal_5883 Int)) (= (select (select (let ((.cse2 (let ((.cse3 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse3 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_5883))))) (store .cse2 |c_~#pre~0.base| (store (select .cse2 |c_~#pre~0.base|) (+ |c_~#pre~0.offset| |v_ULTIMATE.start_worker_fn_~tid~0#1_2612|) v_ArrVal_5886))) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_5886 Int) (v_ArrVal_5883 Int)) (= (let ((.cse6 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (let ((.cse4 (let ((.cse5 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse6 0)))) (store .cse5 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_5883))))) (store .cse4 |c_~#pre~0.base| (store (select .cse4 |c_~#pre~0.base|) (+ |c_~#pre~0.offset| |v_ULTIMATE.start_worker_fn_~tid~0#1_2612|) v_ArrVal_5886))) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse6)) 0)) (forall ((v_ArrVal_5886 Int) (v_ArrVal_5883 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse8 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse8 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_5883))))) (store .cse7 |c_~#pre~0.base| (store (select .cse7 |c_~#pre~0.base|) (+ |c_~#pre~0.offset| |v_ULTIMATE.start_worker_fn_~tid~0#1_2612|) v_ArrVal_5886))) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))))) is different from false [2022-04-18 19:12:17,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:12:17,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:12:17,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:12:17,133 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:12:17,135 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:12:17,136 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:12:17,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:12:17,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:12:17,163 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:12:25,875 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:12:25,977 INFO L356 Elim1Store]: treesize reduction 340, result has 30.5 percent of original size [2022-04-18 19:12:25,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 165 [2022-04-18 19:12:26,024 INFO L356 Elim1Store]: treesize reduction 19, result has 78.4 percent of original size [2022-04-18 19:12:26,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 164 treesize of output 207 [2022-04-18 19:12:26,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2022-04-18 19:12:28,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 19:12:28,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276042001] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 19:12:28,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2072399945] [2022-04-18 19:12:28,395 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2022-04-18 19:12:28,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 19:12:28,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 17] total 44 [2022-04-18 19:12:28,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585219501] [2022-04-18 19:12:28,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 19:12:28,395 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-18 19:12:28,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:12:28,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-18 19:12:28,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1617, Unknown=24, NotChecked=170, Total=2070 [2022-04-18 19:12:28,396 INFO L87 Difference]: Start difference. First operand 47363 states and 97975 transitions. Second operand has 46 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:13:11,471 WARN L232 SmtUtils]: Spent 36.41s on a formula simplification. DAG size of input: 79 DAG size of output: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-18 19:13:19,884 WARN L232 SmtUtils]: Spent 6.32s on a formula simplification. DAG size of input: 84 DAG size of output: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-18 19:13:35,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:13:35,524 INFO L93 Difference]: Finished difference Result 105811 states and 218745 transitions. [2022-04-18 19:13:35,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-18 19:13:35,524 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 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) Word has length 21 [2022-04-18 19:13:35,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:13:35,747 INFO L225 Difference]: With dead ends: 105811 [2022-04-18 19:13:35,747 INFO L226 Difference]: Without dead ends: 105811 [2022-04-18 19:13:35,748 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 106.1s TimeCoverageRelationStatistics Valid=470, Invalid=2703, Unknown=27, NotChecked=222, Total=3422 [2022-04-18 19:13:35,748 INFO L913 BasicCegarLoop]: 580 mSDtfsCounter, 3028 mSDsluCounter, 11927 mSDsCounter, 0 mSdLazyCounter, 19004 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3028 SdHoareTripleChecker+Valid, 7235 SdHoareTripleChecker+Invalid, 34780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 19004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15080 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2022-04-18 19:13:35,748 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3028 Valid, 7235 Invalid, 34780 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [696 Valid, 19004 Invalid, 0 Unknown, 15080 Unchecked, 16.9s Time] [2022-04-18 19:13:35,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105811 states. [2022-04-18 19:13:36,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105811 to 47362. [2022-04-18 19:13:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47362 states, 46010 states have (on average 2.1293849163225387) internal successors, (97973), 47361 states have internal predecessors, (97973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:13:36,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47362 states to 47362 states and 97973 transitions. [2022-04-18 19:13:36,916 INFO L78 Accepts]: Start accepts. Automaton has 47362 states and 97973 transitions. Word has length 21 [2022-04-18 19:13:36,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:13:36,917 INFO L478 AbstractCegarLoop]: Abstraction has 47362 states and 97973 transitions. [2022-04-18 19:13:36,917 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:13:36,917 INFO L276 IsEmpty]: Start isEmpty. Operand 47362 states and 97973 transitions. [2022-04-18 19:13:36,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-18 19:13:36,917 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:13:36,918 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:13:36,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-18 19:13:37,118 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-18 19:13:37,118 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 110 more)] === [2022-04-18 19:13:37,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:13:37,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1842836075, now seen corresponding path program 10 times [2022-04-18 19:13:37,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:13:37,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974354153] [2022-04-18 19:13:37,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:13:37,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:13:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:13:37,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:13:37,520 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:13:37,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974354153] [2022-04-18 19:13:37,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974354153] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 19:13:37,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027667897] [2022-04-18 19:13:37,520 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-18 19:13:37,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:13:37,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 19:13:37,536 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 19:13:37,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-18 19:13:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:13:37,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-18 19:13:37,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 19:13:37,889 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-04-18 19:13:37,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 60 [2022-04-18 19:13:38,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-04-18 19:13:38,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2022-04-18 19:13:38,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2022-04-18 19:13:38,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2022-04-18 19:13:38,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-04-18 19:13:38,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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 [2022-04-18 19:13:38,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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 [2022-04-18 19:13:38,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:13:38,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 Killed by 15